Borodin-Kostochka conjecture holds for odd-hole-free graphs
From MaRDI portal
Publication:6154380
DOI10.1007/S00373-024-02753-0arXiv2310.07214OpenAlexW4391719677MaRDI QIDQ6154380FDOQ6154380
Authors: Rong Chen, Kaiyang Lan, Xinheng Lin, Yidong Zhou 
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
Recommendations
- Borodin-Kostochka conjecture holds for \(\overline{K_{1 , 3}} \)-free graphs
- Borodin-Kostochka's conjecture on \(\{P_2 \cup P_3, C_4\}\)-free graphs
- Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors
- Coloring \(\{ P 2 \cup P 3 , \operatorname{house} \} \)-free graphs with \(\Delta - 1\) colors
- Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)
Cites Work
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- Graph colouring and the probabilistic method
- Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors
- Note on the colouring of graphs
- Coloring Claw-Free Graphs with $\Delta-1$ Colors
- A strengthening of Brooks' theorem
- A survey of \(\chi\)-boundedness
- Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs
- Coloring hammer-free graphs with \(\Delta - 1\) colors
Cited In (4)
This page was built for publication: Borodin-Kostochka conjecture holds for odd-hole-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154380)
