Some generalizations of theorems on vertex coloring

DOI10.1016/j.jcta.2006.01.004zbMath1105.05022OpenAlexW1967291492MaRDI QIDQ855855

S. L. Berlov, Vladimir L. Dol'nikov

Publication date: 7 December 2006

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

Full work available at URL: https://doi.org/10.1016/j.jcta.2006.01.004

zbMATH Keywords

\(k\)-criticalBrooks theoremSzekeres-Wilf theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On the connection between the chromatic number of a graph and the number of cycles covering a vertex or an edge

Cites Work

• An inequality for the chromatic number of a graph
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some generalizations of theorems on vertex coloring