Graphs with k odd cycle lengths

Research output: Contribution to journalArticle

18 Citations (Scopus)


If G is a graph with k ≥ 1 odd cycle lengths then each block of G is either K2k+2 or contains a vertex of degree at most 2k. As a consequence, the chromatic number of G is at most 2k+2.

Original languageEnglish
Pages (from-to)41-48
Number of pages8
JournalDiscrete Mathematics
Issue number1
Publication statusPublished - May 25 1992

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Graphs with k odd cycle lengths'. Together they form a unique fingerprint.

  • Cite this