Small odd cycles in 4-chromatic graphs
type: Item
instance of: scholarly article
title: Small odd cycles in 4-chromatic graphs
zbMATH Open document ID: 0981.05063
author: Tao Jiang
published in: Journal of Graph Theory
publication date: 2001-12-16T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1652667
zbMATH Keywords: odd cycle
zbMATH Keywords: chromatic number
zbMATH Keywords: girth
MaRDI profile type: Publication
full work available at URL: jgt.1006
OpenAlex ID: W4235782589
cites work: On coloring graphs with locally small chromatic number
cites work: 4-chromatic graphs with large odd girth
cites work: Short odd cycles in 4-chromatic graphs
cites work: On constructive methods in the theory of colour-critical graphs
cites work: 4-chromatic projective graphs
DOI: 10.1002/JGT.1006
review text: \textit{A. Nilli} [J. Graph Theory 31, No. 2, 145-147 (1999; Zbl 0924.05044)] showed that every 4-chromatic graph on \(n\) vertices contains an odd cycle of length less than \(\sqrt{8n}\). The author improves this bound to \(2\sqrt{n}+3\).
reviewed by: Norman F. Quimpo
description: scientific article; zbMATH DE number 1652667