Edge Colorings of Planar Graphs

Yu-Wen Wu
School of Mathematics and System Science, Shandong University, Shandong 250100, P. R. China


Abstract     Full Text  PDF

A finite simple graph is of class one if its edge chromatic number is equal to the maximum degree of this graph. Here we present some results on Vizing's Conjecture, that every planar graph with maximum degree 6 or 7 is of class one, and some other problems about the classification of planar graphs.