Sciweavers

EJC
2008
14 years 16 days ago
Coloring squares of planar graphs with girth six
Wang and Lih conjectured that for every g 5, there exists a number M(g) such that the square of a planar graph G of girth at least g and maximum degree M(g) is (+1)-colorable. ...
Zdenek Dvorak, Daniel Král, Pavel Nejedl&ya...