Borodin-Kostochka conjecture holds for odd-hole-free graphs
From MaRDI portal
Publication:6154380
DOI10.1007/s00373-024-02753-0arXiv2310.07214OpenAlexW4391719677MaRDI QIDQ6154380
Xinheng Lin, Rong Chen, Yidong Zhou, Kaiyang Lan
Publication date: 15 February 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2310.07214
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)
Cites Work
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- A strengthening of Brooks' theorem
- Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs
- Note on the colouring of graphs
- A survey of χ‐boundedness
- Coloring Claw-Free Graphs with $\Delta-1$ Colors
- Graph colouring and the probabilistic method
- Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors
- Coloring hammer-free graphs with \(\Delta - 1\) colors
This page was built for publication: Borodin-Kostochka conjecture holds for odd-hole-free graphs
