Double-critical graphs and complete minors

From MaRDI portal
Publication:976747




Abstract: A connected k-chromatic graph G is double-critical if for all edges uv of G the graph Guv is (k2)-colourable. The only known double-critical k-chromatic graph is the complete k-graph Kk. 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 kleq5. We prove for k=6 and k=7 that any non-complete double-critical k-chromatic graph is 6-connected and has Kk as a minor.









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)