Packing seagulls
From MaRDI portal
Publication:2392035
Recommendations
Cites work
- scientific article; zbMATH DE number 3141016 (Why is no real title available?)
- scientific article; zbMATH DE number 3102312 (Why is no real title available?)
- A special case of Hadwiger's conjecture
- Finding minimum clique capacity
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- On a special case of Hadwiger's conjecture
Cited in
(10)- Coloring hypergraphs with excluded minors
- A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two
- Complete graph immersions in dense graphs
- Clique immersions in graphs of independence number two with certain forbidden subgraphs
- Finding minimum clique capacity
- Large minors in graphs with given independence number
- An approximate version of Hadwiger's conjecture for claw-free graphs
- On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs
- On the independence polynomial of the corona of graphs
- Hadwiger's conjecture
This page was built for publication: Packing seagulls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392035)