Every graph with no $K_7^{\vee}$-minor is $6$-colorable

Let $K_{7}^{\lor}$ denote the graph obtained from the complete graph on seven vertices by deleting two edges with a common end. Motivated by Hadwiger’s conjecture, we prove that every graph with no $K_{7}^{\lor}$ -minor is $6$ -colorable.

Every graph with no $K_{7}^{\lor}$ -minor is $6$ -colorable

文献摘要

讨论

讲解博客

AI智能校验

Every graph with no $K_{7}^{\lor}$ -minor is $6$ -colorable

文献摘要

讨论

讲解博客

AI智能校验

Every graph with no K7∨K7∨​-minor is 66-colorable

文献摘要

讨论

|讲解博客

|AI智能校验

Every graph with no K7∨K7∨​-minor is 66-colorable

文献摘要

讨论

|讲解博客

|AI智能校验

Every graph with no $K_{7}^{\lor}$ -minor is $6$ -colorable

讲解博客

AI智能校验

Every graph with no $K_{7}^{\lor}$ -minor is $6$ -colorable

讲解博客

AI智能校验