2 citations · 2 across the 2 of their papers we have counts for
2 papers
math.CO2014★ 2 cited
Linkages in Large Graphs of Bounded Tree-Width
Jan-Oliver Fröhlich, Ken-ichi Kawarabayashi, Theodor Müller +2
We show that all sufficiently large (2k+3)-connected graphs of bounded tree-width are k-linked. Thomassen has conjectured that all sufficiently large (2k+2)-connected graphs are k-…
math.CO2009
On the excluded minor structure theorem for graphs of large treewidth
R. Diestel, K. Kawarabayashi, T. Müller +1
At the core of the Robertson-Seymour theory of graph minors lies a powerful structure theorem which captures, for any fixed graph H, the common structural features of all the graph…