✦ LIBER ✦

The Erdős–Pósa property for clique minors in highly connected graphs

✍ Scribed by Reinhard Diestel; Ken-ichi Kawarabayashi; Paul Wollan

Book ID: 113698903
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 271 KB
Volume: 102
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2011.08.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Erdős–Pósa Property for Odd Cycles i

The Erdős–Pósa Property for Odd Cycles in Highly Connected Graphs

✍ Dieter Rautenbach; Bruce Reed 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 201 KB

The Erdős–Pósa Property for Odd Cycles i

The Erdős–Pósa Property for Odd Cycles in Graphs of Large Connectivity

✍ Carsten Thomassen 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 218 KB

Strengthening Erdös–Pósa property for mi

Strengthening Erdös–Pósa property for minor-closed graph classes

✍ Fedor V. Fomin; Saket Saurabh; Dimitrios M. Thilikos 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB

Let H and G be graph classes. We say that H has the Erd" os-Pósa property for G if for any graph G ∈ G, the minimum vertex covering of all H-subgraphs of G is bounded by a function f of the maximum packing of H-subgraphs in G (by H-subgraph of G we mean any subgraph of G that belongs to H). Robertso

The Erdős–Pósa Property For Long Circuit

The Erdős–Pósa Property For Long Circuits

✍ Etienne Birmelé; J. Adrian Bondy; Bruce A. Reed 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 211 KB