Structure and Coloring of Graphs with Only Small Odd Cycles

DOI10.1137/S0895480197323883zbMath1180.05049OpenAlexW2012495969MaRDI QIDQ3394987

Susan S. Wang

Publication date: 20 August 2009

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

Full work available at URL: https://doi.org/10.1137/s0895480197323883

zbMATH Keywords

algorithmsgraph coloringchromatic numberodd cyclesstructural characterization of graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

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

This page was built for publication: Structure and Coloring of Graphs with Only Small Odd Cycles