Erdős-Lovász Tihany conjecture for graphs with forbidden holes
From MaRDI portal
Publication:2312803
DOI10.1016/j.disc.2019.05.034zbMath1416.05118arXiv1805.11437OpenAlexW2963945397WikidataQ123010026 ScholiaQ123010026MaRDI QIDQ2312803
Publication date: 18 July 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.11437
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (4)
Some remarks on even-hole-free graphs ⋮ Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs ⋮ Partition line graphs of multigraphs into two subgraphs with large chromatic numbers ⋮ Partition graphs of independence number \(2\) into two subgraphs with large chromatic numbers
Cites Work
- Double-critical graph conjecture for claw-free graphs
- Complete and almost complete minors in double-critical 8-chromatic graphs
- The strong perfect graph theorem
- 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
- Claw-free graphs. VII. Quasi-line graphs
- Coloring quasi-line graphs
- Hadwiger's conjecture for quasi-line graphs
- On triangles in ‐minor free graphs
- Clique minors in double‐critical graphs
- A Relaxed Version of the Erdős–Lovász Tihany Conjecture
- Hadwiger's Conjecture for Graphs with Forbidden Holes
- On odd circuits in chromatic graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Erdős-Lovász Tihany conjecture for graphs with forbidden holes