Small odd cycles in 4-chromatic graphs

Authors

Tao Jiang, Michigan Technological UniversityFollow

Document Type

Article

Publication Date

6-2001

Department

Department of Mathematical Sciences

Abstract

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].

Publisher's Statement

© 2001 John wiley & sons, Inc. Publisher’s version of record: https://doi.org/10.1002/jgt.1006

Publication Title

Journal of Graph Theory

Recommended Citation

Jiang, T. (2001). Small odd cycles in 4-chromatic graphs. Journal of Graph Theory, 37(2), 115-117. http://doi.org/10.1002/jgt.1006
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/3728