Face-Degree Bounds for Planar Critical Graphs

Electronic Journal Of Combinatorics

Ligang Jin¹ 

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

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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

【 授权许可】

Others