Abstract
Motivated by the famous Hadwiger's Conjecture, we study the properties of -contraction-critical graphs with no minor; we prove that every -contraction-critical graph with no minor has at most one vertex of degree , where a graph is -contraction-critical if is not -colorable but every proper minor of is -colorable. This is one step in our effort to prove that every graph with no minor is -colorable, which remains open.
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.