Face-degree bounds for planar critical graphs

Abstract

The only remaining case of a well known conjecture of Vizing states that there is no planar graph with maximum degree 6 and edge chromatic number 7. We introduce parameters for planar graphs, based on the degrees of the faces, and study the question whether there are upper bounds for these parameters for planar edge-chromatic critical graphs. Our results provide upper bounds on these parameters for smallest counterexamples to Vizing's conjecture, thus providing a partial characterization of such graphs, if they exist. For $k\le 5$ the results give insights into the structure of planar edge-chromatic critical graphs.

This is new version with updated title and abstract. Furthermore, in Lemma 10, the proof of the families of graphs $G_n,H_n,T_n$ to be critical is added. The published version of the article can be found in "The electronic journal of combinatorics"