Packing seagulls

DOI10.1007/S00493-012-2594-2MaRDI QIDQ2392035zbMATHOpenAlexFDO

Authors Maria Chudnovsky, Paul Seymour

Publication date 6 August 2013

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-012-2594-2

zbMATH Keywords

polynomial-time algorithmHadwiger conjecturelargest stable set of verticesnumber of disjoint seagulls in a graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)

Recommendations

• Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
• A relative of Hadwiger's conjecture
• scientific article; zbMATH DE number 54802
• Hadwiger's conjecture for graphs with forbidden holes
• An approximate version of Hadwiger's conjecture for claw-free graphs

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)