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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.