Colourings of graphs with prescribed odd cycle lengths
Colourings of graphs with prescribed odd cycle lengths
Matos Camacho, S.; Schiermeyer, I.
In 1992 Gyárfás showed that a graph G having only k odd cycle lengths is (2k+1)-colourable, if it does not contain a K2k+2. In this paper, we will present the results for graphs containing only odd cycles of length 2m−1 and 2m+1 as done in [S. Matos Camacho, Colourings of graph with prescribed cycle lengths, diploma thesis, TU Bergakademie Freiberg, 2006. [3]]. We will show that these graphs are 4-colourable.
Keywords: Colouring; Cycles; Chromatic number
-
Discrete Mathematics 309(2009)15, 4916-4919
DOI: 10.1016/j.disc.2008.04.042
Cited 3 times in Scopus
Permalink: https://www.hzdr.de/publications/Publ-20514
Publ.-Id: 20514