253 search results - page 6 / 51 » Perfection thickness of graphs |
114
click to vote
ENDM
2007
15 years 4 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 ...
124
click to vote
CP
2008
Springer
15 years 5 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...
136
click to vote
ENDM
2006
15 years 4 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
15 years 3 months ago
2002
147
click to vote
EJC
2010
15 years 4 months ago
2010
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...