Packing seagulls

DOI10.1007/S00493-012-2594-2zbMATH Open1289.05444OpenAlexW3189706900MaRDI QIDQ2392035FDOQ2392035

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

Recommendations

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

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)

Cites Work

• Title not available (Why is that?)
• On a special case of Hadwiger's conjecture
• Title not available (Why is that?)
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• A special case of Hadwiger's conjecture
• Finding minimum clique capacity

Cited In (10)

• On the independence polynomial of the corona of graphs
• Coloring hypergraphs with excluded minors
• Complete graph immersions in dense graphs
• On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs
• Hadwiger’s Conjecture
• Clique immersions in graphs of independence number two with certain forbidden subgraphs
• A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two
• An approximate version of Hadwiger's conjecture for claw-free graphs
• Finding minimum clique capacity
• Large minors in graphs with given independence number

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)