Double-critical graph conjecture for claw-free graphs
From MaRDI portal
Publication:526254
DOI10.1016/J.DISC.2017.03.005zbMath1361.05054arXiv1610.00636OpenAlexW2964050953WikidataQ122956890 ScholiaQ122956890MaRDI QIDQ526254
Publication date: 10 May 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.00636
Related Items (3)
Critical graphs for the chromatic edge-stability number ⋮ Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs ⋮ Erdős-Lovász Tihany conjecture for graphs with forbidden holes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complete and almost complete minors in double-critical 8-chromatic graphs
- Claw-free graphs. V. Global structure
- Double-critical graphs and complete minors
- Partitions and edge colourings of multigraphs
- The Erdős-Lovász tihany conjecture for quasi-line graphs
- \(K_ 5\) is the only double-critical 5-chromatic graph
- A Relaxed Version of the Erdős–Lovász Tihany Conjecture
- On odd circuits in chromatic graphs
This page was built for publication: Double-critical graph conjecture for claw-free graphs