Coloring hammer-free graphs with \(\Delta - 1\) colors

DOI10.1016/j.disc.2023.113823MaRDI QIDQ6177425

Rong Chen, Kaiyang Lan, Xinheng Lin

Publication date: 17 January 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

induced subgraphschromatic numberBorodin-Kostochka conjecture

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Borodin-Kostochka conjecture holds for odd-hole-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On an upper bound of the graph's chromatic number, depending on the graph's degree and density
• A strengthening of Brooks' theorem
• Note on the colouring of graphs
• Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors

This page was built for publication: Coloring hammer-free graphs with \(\Delta - 1\) colors