A new upper bound for the chromatic number of a graph

DOI10.7151/DMGT.1350zbMath1137.05035OpenAlexW2054104670MaRDI QIDQ5444063

Ingo Schiermeyer

Publication date: 22 February 2008

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/9f1270359dba48597a03ee0d2d4b5feb6b64bc50

zbMATH Keywords

clique numbervertex colouringchromatic number upper bound

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Graph coloring approach with new upper bounds for the chromatic number: team building application ⋮ Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \)

This page was built for publication: A new upper bound for the chromatic number of a graph