A note on \(\Delta\)-critical graphs

DOI10.1007/s00373-023-02696-yzbMath1526.05049MaRDI QIDQ6063276

Penny E. Haxell, Reza Naserasr

Publication date: 7 November 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

vertex colouring\(k\)-criticalBorodin-Kostochka conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Colouring graphs when the number of colours is almost the maximum degree
• Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker
• On an upper bound of the graph's chromatic number, depending on the graph's degree and density
• A strengthening of Brooks' theorem
• Colour-critical graphs and hypergraphs
• A Note on Vertex List Colouring
• Graphs with $\chi=\Delta$ Have Big Cliques
• On graphs having prescribed clique number, chromatic number, and maximum degree
• Hitting all maximum cliques with a stable set using lopsided independent transversals
• Coloring Claw-Free Graphs with $\Delta-1$ Colors

This page was built for publication: A note on \(\Delta\)-critical graphs