An approximate version of Hadwiger's conjecture for claw-free graphs
From MaRDI portal
Publication:3553232
DOI10.1002/JGT.20425zbMATH Open1216.05061OpenAlexW4234387146WikidataQ122979949 ScholiaQ122979949MaRDI QIDQ3553232FDOQ3553232
Maria Chudnovsky, Alexandra Fradkin
Publication date: 22 April 2010
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20425
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)
Cites Work
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Packing seagulls
- Claw-free graphs. V. Global structure
- Title not available (Why is that?)
- Claw-free graphs. I: Orientable prismatic graphs
- Hadwiger's conjecture for line graphs
- A special case of Hadwiger's conjecture
- Hadwiger's conjecture for quasi-line graphs
Cited In (12)
- Title not available (Why is that?)
- Domination When the Stars Are Out
- Title not available (Why is that?)
- Hadwiger’s Conjecture
- Title not available (Why is that?)
- The degree-diameter problem for claw-free graphs and hypergraphs
- Title not available (Why is that?)
- Clique minors in claw-free graphs
- Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
- Hadwiger's Conjecture for Graphs with Forbidden Holes
- On the Erdős-Gyárfás conjecture in claw-free graphs
- Double-critical graph conjecture for claw-free graphs
Recommendations
This page was built for publication: An approximate version of Hadwiger's conjecture for claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3553232)
