2020/02/24 by Feng, Jieru, Gao, Yuping, Wu, Jianliang
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2002.10109
In 1965, Vizing proved that every planar graph G with maximum degree Δ≥ 8 is edge Δ-colorable. It is also proved that every planar graph G with maximum degree Δ=7 is edge Δ-colorable by Sanders and Zhao, independently by Zhang. In this paper, we extend the above results by showing that every K5-minor free graph with maximum degree Δ at least seven is edge Δ-colorable.