✦ LIBER ✦

Complete graph minors and the graph minor structure theorem

✍ Scribed by Gwenaël Joret; David R. Wood

Book ID: 119292678
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 285 KB
Volume: 103
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2012.09.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complete minors in pseudorandom graphs

✍ Andrew Thomason 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB 👁 1 views

Complete Minors InKs,s-Free Graphs

✍ Daniela Kühn; Deryk Osthus 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 262 KB

An accessibility theorem for infinite gr

An accessibility theorem for infinite graph minors

✍ Reinhard Diestel 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 67 KB

Unprovability threshold for the planar g

Unprovability threshold for the planar graph minor theorem

✍ Andrey Bovykin 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 226 KB

Graph minors and linkages

✍ G. Chen; R. J. Gould; K. Kawarabayashi; F. Pfender; B. Wei 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB

## Abstract Bollobás and Thomason showed that every 22__k__‐connected graph is __k__‐linked. Their result used a dense graph minor. In this paper, we investigate the ties between small graph minors and linkages. In particular, we show that a 6‐connected graph with a __K__ minor is 3‐linked. Further

On the excluded minor structure theorem

On the excluded minor structure theorem for graphs of large tree-width

✍ Reinhard Diestel; Ken-ichi Kawarabayashi; Theodor Müller; Paul Wollan 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 380 KB