arXiv 2016-05-30 EN Duality theorems for blocks and tangles in graphs Diestel, Reinhard · Eberenz, Philipp · Erde, Joshua
arXiv 2013-05-31 EN Polynomial Gap Extensions of the Erdős-Pósa Theorem Raymond, Jean-Florent · Thilikos, Dimitrios M.
arXiv 2013-05-30 EN Low Polynomial Exclusion of Planar Graph Patterns Raymond, Jean-Florent · Thilikos, Dimitrios M.
arXiv 2012-07-25 EN Finding minors in graphs with a given path structure Kündgen, André · Pelsmajer, Michael J. · Ramamurthi, Radhika
arXiv 2011-06-13 EN Obstructions for linear rankwidth at most 1 Adler, Isolde · Farley, Arthur M. · Proskurowski, Andrzej
arXiv 2011-02-28 EN Optimizing the Graph Minors Weak Structure Theorem Giannopoulou, Archontia C. · Thilikos, Dimitrios M.
arXiv 2009-10-06 EN On the excluded minor structure theorem for graphs of large treewidth Diestel, R. · Kawarabayashi, K. · Müller, T. · Wollan, P.
arXiv 2009-06-15 EN Linear Connectivity Forces Large Complete Bipartite Minors: the Patch for the Large Tree-Width Case Fröhlich, Jan-Oliver · Müller, Theodor
arXiv 2008-09-03 EN Polynomial treewidth forces a large grid-like-minor Reed, Bruce A. · Wood, David R.
arXiv 2006-06-23 EN Unavoidable Parallel Minors of 4-Connected Graphs Chun, Carolyn · Ding, Guoli · Oporowski, Bogdan · Vertigan, Dirk
arXiv 2005-05-22 EN Hadwiger Number and the Cartesian Product Of Graphs Chandran, L. Sunil · Kostochka, Alexandr · Raju, J. Krishnam
