Colourings of graphs with two consecutive odd cycle lengths

DOI10.1016/J.DISC.2008.04.042MaRDI QIDQ1044922zbMATH OpenOpenAlexFDO

Authors Stephan Matos Camacho, Ingo Schiermeyer

Publication date 15 December 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2008.04.042

zbMATH Keywords

chromatic numbercolouringcycles

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• Coloring graphs with two odd cycle lengths
• Graphs with \(k\) odd cycle lengths
• Colouring Graphs with Prescribed Induced Cycle Lengths
• Graphs with odd cycle lengths 5 and 7 are 3-colorable
• Cycle length parities and the chromatic number

Cites work

• scientific article; zbMATH DE number 4164941 (Why is no real title available?)
• Graphs with \(k\) odd cycle lengths

Cited in

(5)

• Coloring graphs with two odd cycle lengths
• Structure and Coloring of Graphs with Only Small Odd Cycles
• Cycle length parities and the chromatic number
• Graphs with odd cycle lengths 5 and 7 are 3-colorable
• Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts

This page was built for publication: Colourings of graphs with two consecutive odd cycle lengths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044922)