Small odd cycles in 4-chromatic graphs
It is shown that every 4-chromatic graph on n vertices contains an odd cycle of length less than 2√n+3. This improves the previous bound given by Nilli [J Graph Theory 3 (1999), 145-147]. © 2001 John wiley & sons, Inc.
Journal of Graph Theory
Small odd cycles in 4-chromatic graphs.
Journal of Graph Theory,
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/3728