Title of article :
Planar Graphs of Maximum Degree Seven are Class I
Author/Authors :
Sanders، نويسنده , , Daniel P. and Zhao، نويسنده , , Yue، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Abstract :
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.
Journal title :
Journal of Combinatorial Theory Series B
Journal title :
Journal of Combinatorial Theory Series B