A better upper bound on the chromatic number of (cap, even-hole)-free graphs
From MaRDI portal
Publication:1981707
DOI10.1016/j.disc.2021.112581zbMath1472.05059OpenAlexW3194945195MaRDI QIDQ1981707
Publication date: 6 September 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112581
Cites Work
- Unnamed Item
- Unnamed Item
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- Induced subgraphs of graphs with large chromatic number. III: Long holes
- On rigid circuit graphs
- On the chromatic number of disjointness graphs of curves
- The strong perfect graph theorem
- Bisimplicial vertices in even-hole-free graphs
- Structure and algorithms for (cap, even hole)-free graphs
- A note on chromatic number of (cap, even hole)-free graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Induced subgraphs of graphs with large chromatic number. VII: Gyárfás' complementation conjecture
- Corrigendum to: ``Bisimplicial vertices in even-hole-free graphs
- The chromatic number of graphs with no induced subdivision of \(K_4\)
- Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
- Graph Theory and Probability
- Even and odd holes in cap-free graphs
- Even-hole-free graphs: A survey
- A result on the optimal binding function of odd signable graphs
- A survey of χ‐boundedness
- Linearly χ‐bounding (P6, C4)‐free graphs*
