Premium
Short odd cycles in 4‐chromatic graphs
Author(s) -
Nilli A.
Publication year - 1999
Publication title -
journal of graph theory
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199906)31:2<145::aid-jgt7>3.0.co;2-e
Subject(s) - combinatorics , mathematics , chromatic scale , graph , wheel graph , discrete mathematics , graph power , line graph
It is shown that any 4‐chromatic graph on n vertices contains an odd cycle of length smaller than √8 n . © 1999 John Wiley & Sons, Inc. J Graph Theory 31: 145–147, 1999