Colouring Graphs with Prescribed Induced Cycle Lengths

DOI10.7151/dmgt.1149zbMath1002.05026OpenAlexW1976661633MaRDI QIDQ4542873

Ingo Schiermeyer, Bert Randerath

Publication date: 7 January 2003

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1149

zbMATH Keywords

chromatic numberpolynomial time algorithms\(\chi\)-binding function

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Cycle lengths and chromatic number of graphs ⋮ On the connection between the chromatic number of a graph and the number of cycles covering a vertex or an edge ⋮ 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.

This page was built for publication: Colouring Graphs with Prescribed Induced Cycle Lengths