An approximate version of Hadwiger's conjecture for claw-free graphs
From MaRDI portal
Publication:3553232
Recommendations
Cites work
- scientific article; zbMATH DE number 3102312 (Why is no real title available?)
- A special case of Hadwiger's conjecture
- Claw-free graphs. I: Orientable prismatic graphs
- Claw-free graphs. V. Global structure
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Hadwiger's conjecture for line graphs
- Hadwiger's conjecture for quasi-line graphs
- Packing seagulls
Cited in
(19)- On the Erdős-Gyárfás conjecture in claw-free graphs
- Partial result on Hadwiger's conjecture
- scientific article; zbMATH DE number 7080199 (Why is no real title available?)
- A special case of Hadwiger's conjecture
- Disproof of the group coloring version of the Hadwiger conjecture
- Hadwiger's conjecture is true for almost every graph
- scientific article; zbMATH DE number 7274067 (Why is no real title available?)
- Hadwiger's conjecture for graphs with forbidden holes
- scientific article; zbMATH DE number 475585 (Why is no real title available?)
- A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two
- The degree-diameter problem for claw-free graphs and hypergraphs
- Packing seagulls
- Hadwiger's conjecture
- Hadwiger's conjecture and squares of chordal graphs
- Clique minors in claw-free graphs
- scientific article; zbMATH DE number 7204318 (Why is no real title available?)
- Claw-free graphs, skeletal graphs, and a stronger conjecture on , , and
- Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
- Double-critical graph conjecture for claw-free graphs
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)