### Abstract

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

Original language | English |
---|---|

Pages (from-to) | 41-48 |

Number of pages | 8 |

Journal | Discrete Mathematics |

Volume | 103 |

Issue number | 1 |

DOIs | |

Publication status | Published - 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

Gyárfás, A. (1992). Graphs with k odd cycle lengths.

*Discrete Mathematics*,*103*(1), 41-48. https://doi.org/10.1016/0012-365X(92)90037-G