Premium
Small odd cycles in 4‐chromatic graphs *
Author(s) -
Jiang Tao
Publication year - 2001
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.1006
Subject(s) - combinatorics , mathematics , chromatic scale , graph , discrete mathematics , upper and lower bounds , friendship graph , wheel graph , graph power , line graph , mathematical analysis
It is shown that every 4‐chromatic graph on n vertices contains an odd cycle of length less than $2\sqrt {n}\,+3$ . This improves the previous bound given by Nilli [J Graph Theory 3 (1999), 145–147]. © 2001 John Wiley & Sons, Inc. J Graph Theory 37: 115–117, 2001
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom