Recommendations
- Induced subgraphs of graphs with large chromatic number. VII: Gyárfás' complementation conjecture
- Some problems on induced subgraphs
- Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
Cites work
- scientific article; zbMATH DE number 1002021 (Why is no real title available?)
- scientific article; zbMATH DE number 3747156 (Why is no real title available?)
- scientific article; zbMATH DE number 3480625 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- Applications of hypergraph coloring to coloring graphs not inducing certain trees
- Induced subtrees in graphs of large chromatic number
- On-Line Coloring and Recursive Graph Theory
- Radius two trees specify χ‐bounded classes
Cited in
(12)- Induced subgraphs of induced subgraphs of large chromatic number
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- Excluding induced subdivisions of the bull and related graphs
- Cycle lengths and chromatic number of graphs
- Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures
- Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case
- Substitution and \(\chi\)-boundedness
- Amalgams and -boundedness
- A note on chromatic number and induced odd cycles
- Chromatic number, induced cycles, and non-separating cycles
- Some problems on induced subgraphs
- Induced Cycle Path Number of Graphs
This page was built for publication: Induced cycles and chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306304)
