1 research outputs found
The edge colorings of -minor free graphs
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.Comment: 14 pages, 1 figur