On the chromatic number of \(H\)-free graphs of large minimum degree
From MaRDI portal
Publication:659735
DOI10.1007/s00373-010-0994-xzbMath1234.05096OpenAlexW2017921399WikidataQ105583468 ScholiaQ105583468MaRDI QIDQ659735
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0994-x
Related Items (3)
The minimum degree removal lemma thresholds ⋮ Triangle-Free Subgraphs of Random Graphs ⋮ Homomorphism thresholds for odd cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Kneser's conjecture, chromatic number, and homotopy
- \(H\)-free graphs of large minimum degree
- On the structure of triangle-free graphs of large minimum degree
- Subtrees and subforests of graphs
- On the chromatic number of triangle-free graphs of large minimum degree
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- Dense \(H\)-free graphs are almost \((\chi (H)-1)\)-partite
- On the chromatic number of pentagon-free graphs of large minimum degree
- On a valence problem in extremal graph theory
- Dense graphs with small clique number
- Graph Theory and Probability
- ODD Cycles of Specified Length in Non-Bipartite Graphs
- On the structure of linear graphs
This page was built for publication: On the chromatic number of \(H\)-free graphs of large minimum degree
