A bound on the chromatic number using the longest odd cycle length
From MaRDI portal
Publication:3437002
DOI10.1002/jgt.20209zbMath1120.05030OpenAlexW4234953542WikidataQ114236190 ScholiaQ114236190MaRDI QIDQ3437002
Sundar Vishwanathan, Sreyash Kenkre
Publication date: 11 May 2007
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20209
Related Items (5)
Congruence of cycle lengths and chromatic number ⋮ Circumference, chromatic number and online coloring ⋮ Colouring edges with many colours in cycles ⋮ Coloring digraphs with forbidden cycles ⋮ Cycle length parities and the chromatic number
Cites Work
This page was built for publication: A bound on the chromatic number using the longest odd cycle length
