Bounds for the chromatic number of graphs with partial information

DOI10.1016/S0012-365X(02)00569-1zbMath1014.05023OpenAlexW2012499493MaRDI QIDQ1869218

S. Louis Hakimi, William C. Coffman, Edward F. Schmeichel

Publication date: 9 April 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00569-1

zbMATH Keywords

independence numberchromatic numberclique numberdegree sequence

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

This page was built for publication: Bounds for the chromatic number of graphs with partial information