20 citations · 118 across the 29 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.DS2014
An exact characterization of tractable demand patterns for maximum disjoint path problems
Dániel Marx, Paul Wollan
We study the following general disjoint paths problem: given a supply graph , a set of terminals, a demand graph on the vertices , and an integer , t…
math.CO2014
A structure theorem for strong immersions
Zdenek Dvorak, Paul Wollan
A graph H is strongly immersed in G if H is obtained from G by a sequence of vertex splittings (i.e., lifting some pairs of incident edges and removing the vertex) and edge removal…
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-…