Hamburg papers on
Graph minors, tree-structure and connectivity
- Profiles. An algebraic approach to combinatorial connectivity
(Fabian Hundertmark), preprint 2011; PDF
- Connectivity and tree-structure in finite graphs (Johannes
Carmesin, Reinhard Diestel, Fabian Hundertmark & Maya
Stein), preprint 2011; PDF.
- The Erdös-Pósa property for clique minors in
highly connected graphs (Reinhard Diestel, Ken-ichi
Kawarabayashi & Paul Wollan), J. Combin. Theory (Series B)
102 (2012), 454-469; PDF.
- On the excluded minor structure theorem for graphs of large
tree-width (Reinhard Diestel, Ken-ichi Kawarabayashi, Theo
Müller & Paul Wollan), preprint 2009; PDF.
- Linear connectivity forces large complete bipartite minors:
An alternative approach (Jan-Oliver Fröhlich & Theo
Müller), J. Combin. Theory (Series B), 101 (2011), 502–508;
ArXiv 2009.