加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本