Planar Graphs Of Maximum Degree Seven Are Class I
In 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chromatic number equal to their maximum degree. He conjectured the same if the maximum degree is either six or seven. This article proves the maximum degree seven case. © 2001 Academic Press.
Journal of Combinatorial Theory. Series B
Number of Pages
Source API URL
Sanders, Daniel P. and Zhao, Yue, "Planar Graphs Of Maximum Degree Seven Are Class I" (2001). Scopus Export 2000s. 522.