Chromatic number of graphs each path of which is 3-colourable

DOI10.1007/BF03322762zbMath1007.05051OpenAlexW2164702673MaRDI QIDQ1601403

Bert Randerath, Ingo Schiermeyer

Publication date: 18 March 2003

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

Full work available at URL: https://doi.org/10.1007/bf03322762

zbMATH Keywords

coloring

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Problems close to my heart ⋮ Circumference, chromatic number and online coloring ⋮ 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.

Cites Work

• Unnamed Item

This page was built for publication: Chromatic number of graphs each path of which is 3-colourable