Finding minimum clique capacity

DOI10.1007/S00493-012-2891-9zbMath1289.05371OpenAlexW2121150643MaRDI QIDQ2392036

Sang-il Oum, Maria Chudnovsky, P. D. 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-2891-9

zbMATH Keywords

capacitypackingHadwiger's conjecture

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Packing seagulls

Cites Work

• Packing seagulls
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Finding minimum clique capacity