(\(\Delta-k\))-critical graphs

DOI10.1016/j.jctb.2004.09.006zbMath1062.05056OpenAlexW1968677127MaRDI QIDQ1767668

Babak Farzad, Bruce A. Reed, Michael S. O. Molloy

Publication date: 8 March 2005

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.09.006

zbMATH Keywords

colouringchromatic numberprobabilistic methodmaximum degreecritical graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ When removing an independent set is optimal for reducing the chromatic number ⋮ Large cliques in graphs with high chromatic number ⋮ On the Grundy and \(b\)-chromatic numbers of a graph ⋮ Colouring graphs when the number of colours is almost the maximum degree ⋮ On bounding the difference of the maximum degree and the clique number ⋮ On the Grundy Number of a Graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On critical subgraphs of colour-critical graphs
• A strengthening of Brooks' theorem
• Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
• Chromatic neighborhood sets
• Small graphs with chromatic number 5: A computer search
• Colouring graphs when the number of colours is nearly the maximum degree
• 25 pretty graph colouring problems

This page was built for publication: (\(\Delta-k\))-critical graphs