Graphs with \(k\) odd cycle lengths

DOI10.1016/0012-365X(92)90037-GzbMath0773.05072OpenAlexW2033366500MaRDI QIDQ1196747

S. Singh

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90037-g

zbMATH Keywords

blockchromatic number

Mathematics Subject Classification ID

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

Related Items (16)

Cycle lengths and chromatic number of graphs ⋮ Problems on cycles and colorings ⋮ Cycle lengths and minimum degree of graphs ⋮ Congruence of cycle lengths and chromatic number ⋮ A solution to Erdős and Hajnal’s odd cycle problem ⋮ Coloring Graphs with Two Odd Cycle Lengths ⋮ Circumference, chromatic number and online coloring ⋮ Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts ⋮ Coloring digraphs with forbidden cycles ⋮ Subdivisions of four blocks cycles in digraphs with large chromatic number ⋮ Cycles in triangle-free graphs of large chromatic number ⋮ Cycle lengths in sparse graphs ⋮ A Strengthening on Odd Cycles in Graphs of Given Chromatic Number ⋮ The extremal function for cycles of length \(\ell\) mod \(k\) ⋮ Colourings of graphs with two consecutive odd cycle lengths ⋮ Cycles and new bounds for the chromatic number

Cites Work

• Unnamed Item

This page was built for publication: Graphs with \(k\) odd cycle lengths