Induced cycles and chromatic number

DOI10.1006/jctb.1998.1894zbMath0936.05041OpenAlexW2167467023MaRDI QIDQ1306304

Alexander D. Scott

Publication date: 20 December 1999

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1998.1894

zbMATH Keywords

chromatic numberinduced cycle

Mathematics Subject Classification ID

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

Related Items (7)

Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case ⋮ Excluding Induced Subdivisions of the Bull and Related Graphs ⋮ Induced subgraphs of graphs with large chromatic number. I. Odd holes ⋮ A note on chromatic number and induced odd cycles ⋮ Amalgams and χ-Boundedness ⋮ Substitution and \(\chi\)-boundedness ⋮ Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures

Cites Work

• Induced subtrees in graphs of large chromatic number
• Applications of hypergraph coloring to coloring graphs not inducing certain trees
• Radius two trees specify χ‐bounded classes
• On-Line Coloring and Recursive Graph Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Induced cycles and chromatic number