Double-critical graphs and complete minors

Details Double-critical graphs and complete minors Double-critical graphs and complete minors

2008-10-17

arxiv.org/abs/0810.3133v1

Mathematics

Combinatorics

Scientific paper

A connected $k$-chromatic graph $G$ is double-critical if for all edges $uv$ of $G$ the graph $G - u - v$ is $(k-2)$-colourable. The only known double-critical $k$-chromatic graph is the complete $k$-graph $K_k$. The conjecture that there are no other double-critical graphs is a special case of a conjecture from 1966, due to Erd\H{o}s and Lov\'asz. The conjecture has been verified for $k \leq 5$. We prove for $k=6$ and $k=7$ that any non-complete double-critical $k$-chromatic graph is 6-connected and has $K_k$ as a minor.

Affiliated with

Also associated with

No associations

Rating

Double-critical graphs and complete minors does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Double-critical graphs and complete minors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Double-critical graphs and complete minors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-352271