Induced cycles and chromatic number
From MaRDI portal
Publication:1306304
DOI10.1006/JCTB.1998.1894zbMATH Open0936.05041OpenAlexW2167467023MaRDI QIDQ1306304FDOQ1306304
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Induced subtrees in graphs of large chromatic number
- Radius two trees specify χ‐bounded classes
- On-Line Coloring and Recursive Graph Theory
- Applications of hypergraph coloring to coloring graphs not inducing certain trees
Cited In (9)
- 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
- 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)
