Face-Degree Bounds for Planar Critical Graphs

[摘要] 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 whet

[学科分类] 离散数学和组合数学

[关键词] Vizing's planar graph conjecture;Planar graph;Critical graphs;Edge colorings