Double-critical graphs and complete minors
From MaRDI portal
Publication:976747
Abstract: A connected -chromatic graph is double-critical if for all edges of the graph is -colourable. The only known double-critical -chromatic graph is the complete -graph . The conjecture that there are no other double-critical graphs is a special case of a conjecture from 1966, due to ErdH{o}s and Lov'asz. The conjecture has been verified for . We prove for and that any non-complete double-critical -chromatic graph is 6-connected and has as a minor.
Recommendations
Cited in
(16)- Complete and almost complete minors in double-critical 8-chromatic graphs
- On graphs double-critical with respect to the colouring number
- On the double-critical graph conjecture
- Double-critical \(k\)-chromatic graphs
- A relaxed version of the Erdős-Lovász Tihany conjecture
- Remarks on a conjecture of Barát and Tóth
- Generalized matrix graphs and completely independent critical cliques in any dimension
- Complete decomposable graphs
- List bouble-critical graphs
- Edge double-critical graphs
- Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs
- Erdős-Lovász Tihany conjecture for graphs with forbidden holes
- Cycles in color-critical graphs
- Clique minors in double-critical graphs
- scientific article; zbMATH DE number 4127229 (Why is no real title available?)
- Double-critical graph conjecture for claw-free graphs
This page was built for publication: Double-critical graphs and complete minors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976747)