20 search results - page 2 / 4 » Game List Colouring of Graphs |
ENDM
2007
13 years 8 months ago
2007
In 1977, Wegner conjectured that the chromatic number of the square of every planar graph G with maximum degree ∆ ≥ 8 is at most 3
CSR
2010
Springer
14 years 1 months ago
2010
Springer
ENDM
2008
13 years 8 months ago
2008
ENDM
2010
13 years 8 months ago
2010
Galvin solved the Dinitz conjecture by proving that bipartite graphs are -edge-choosable. We employ Galvin's method to show some further list edgecolouring properties of bipa...
JSAT
2008
13 years 8 months ago
2008
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...