Graphs with odd cycle lengths 5 and 7 are 3-colorable

DOI10.1137/090761860MaRDI QIDQ3225107zbMATH OpenOpenAlexFDO

Authors Tomáš Kaiser, Ondřej Rucký, Riste Škrekovski

Publication date 15 March 2012

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/527d2177e088734dc1d9d9ce0f5123f2d43fe525

zbMATH Keywords

3-colorability4-critical\(H\)-bridgecoloringodd cycleodd cycle length

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
• Cycle lengths and chromatic number of graphs
• Colourings of graphs with two consecutive odd cycle lengths
• Cycle length parities and the chromatic number

Cited in

(9)

• Colourings of graphs with two consecutive odd cycle lengths
• Graphs with \(k\) odd cycle lengths
• A note on a conjecture of Wu, Xu and Xu
• Subdivisions of four blocks cycles in digraphs with large chromatic number
• Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts
• Coloring graphs with two odd cycle lengths
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• The chromatic number of heptagraphs
• On subdivisions of four blocks cycles with two non-consecutive blocks of length one in digraphs with large chromatic number

This page was built for publication: Graphs with odd cycle lengths 5 and 7 are 3-colorable

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