The edge colorings of -minor free graphs
arXiv:2002.10109
Abstract
In 1965, Vizing proved that every planar graph with maximum degree is edge -colorable. It is also proved that every planar graph with maximum degree is edge -colorable by Sanders and Zhao, independently by Zhang. In this paper, we extend the above results by showing that every -minor free graph with maximum degree at least seven is edge -colorable.
14 pages, 1 figure