On graphs having prescribed clique number, chromatic number, and maximum degree

DOI10.1007/BFb0070370zbMath0402.05045MaRDI QIDQ4186359

Phyllis Z. Chinn, James M. Benedict

Publication date: 1978

Published in: Lecture Notes in Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

A note on \(\Delta\)-critical graphs ⋮ Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker

This page was built for publication: On graphs having prescribed clique number, chromatic number, and maximum degree