New bounds for the chromatic number of graphs
From MaRDI portal
Publication:3506313
DOI10.1002/jgt.20298zbMath1149.05018OpenAlexW4235439855MaRDI QIDQ3506313
Publication date: 12 June 2008
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20298
Related Items (10)
A note on orientation and chromatic number of graphs ⋮ Bounds for chromatic number in terms of even-girth and booksize ⋮ Bounds for the Grundy chromatic number of graphs in terms of domination number ⋮ Computational aspects of greedy partitioning of graphs ⋮ On Computational Aspects of Greedy Partitioning of Graphs ⋮ Minimum order of graphs with given coloring parameters ⋮ Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs ⋮ More bounds for the Grundy number of graphs ⋮ New potential functions for greedy independence and coloring ⋮ On lower bounds for the chromatic number in terms of vertex degree
Cites Work
This page was built for publication: New bounds for the chromatic number of graphs
