Graphs with Odd Cycle Lengths 5 and 7 are 3-Colorable

DOI10.1137/090761860zbMath1237.05078OpenAlexW2038995914MaRDI QIDQ3225107

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

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

coloringodd cycle3-colorability\(H\)-bridge4-criticalodd cycle length

Mathematics Subject Classification ID

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

Related Items (4)

Coloring Graphs with Two Odd Cycle Lengths ⋮ Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts ⋮ Nowhere-zero 3-flows and modulo \(k\)-orientations ⋮ Subdivisions of four blocks cycles in digraphs with large chromatic number

This page was built for publication: Graphs with Odd Cycle Lengths 5 and 7 are 3-Colorable