Degree‐bounded coloring of graphs: Variations on a theme by brooks

DOI10.1002/jgt.3190200207zbMath0843.05038OpenAlexW2048840975MaRDI QIDQ4852403

Edward F. Schmeichel, S. Louis Hakimi, John Mitchem

Publication date: 31 October 1995

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190200207

zbMATH Keywords

characterizationtreescoloringBrooks' theoremset colorings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Improved bounds for the chromatic index of graphs and multigraphs ⋮ A survey on the Intersection graphs of ideals of rings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Degree‐bounded coloring of graphs: Variations on a theme by brooks