Clique minors in claw-free graphs
From MaRDI portal
Publication:765191
DOI10.1016/J.JCTB.2011.04.005zbMATH Open1237.05176OpenAlexW2140820229MaRDI QIDQ765191FDOQ765191
Publication date: 19 March 2012
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2011.04.005
Recommendations
Cites Work
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- On a special case of Hadwiger's conjecture
- Claw-free graphs. V. Global structure
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- The four-colour theorem
- Title not available (Why is that?)
- On Hadwiger's Number and the Stability Number
- Claw-free graphs. VI: Colouring
- Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
- Independent sets in graphs with an excluded clique minor
- Hadwiger's conjecture for line graphs
- Hadwiger's conjecture for quasi-line graphs
- An approximate version of Hadwiger's conjecture for claw-free graphs
- Complete Minors and Independence Number
- Independence number and clique minors
- Subcontraction-equivalence and Hadwiger's conjecture
Cited In (10)
- Minimal claw-free graphs
- THE CLIQUE MINOR OF GRAPHS WITH INDEPENDENCE NUMBER TWO
- Excluding infinite clique minors
- Hadwiger’s Conjecture
- Clique minors in graphs with a forbidden subgraph
- Clique-chromatic numbers of claw-free graphs
- Disjoint cliques in claw-free graphs
- Cliques, minors and apex graphs
- Large minors in graphs with given independence number
- Minimum clique-free subgraphs of Kneser graphs
This page was built for publication: Clique minors in claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765191)
