Double-critical graphs and complete minors
From MaRDI portal
Publication:976747
zbMATH Open1215.05069arXiv0810.3133MaRDI QIDQ976747FDOQ976747
Authors: Anders Sune Pedersen, Bjarne Toft, Ken-ichi Kawarabayashi
Publication date: 16 June 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0810.3133
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cited In (10)
- On the double-critical graph conjecture
- Complete decomposable 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
- Title not available (Why is that?)
- A Relaxed Version of the Erdős–Lovász Tihany Conjecture
- Double-critical graph conjecture for claw-free graphs
- Complete and almost complete minors in double-critical 8-chromatic 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)