483 search results - page 5 / 97 » On perfectness of sums of graphs |
ENDM
2007
13 years 7 months ago
2007
Kreweras’ conjecture [9] asserts that every perfect matching of the hypercube Qd can be extended to a Hamiltonian cycle of Qd. We [5] proved this conjecture but here we present ...
CP
2008
Springer
13 years 9 months ago
2008
Springer
By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. Thes...
ENDM
2006
13 years 7 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
COMBINATORICA
2002
13 years 7 months ago
2002
ENDM
2010
13 years 7 months ago
2010
A main result of combinatorial optimization is that clique and chromatic number of a perfect graph are computable in polynomial time (Gr