970 citations · 1.7k across the 49 of their papers we have counts for
3 papers · 1 filter
Finding topological subgraphs is fixed-parameter tractable
Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx +1
We show that for every fixed undirected graph , there is a time algorithm that tests, given a graph , if contains as a topological subgraph (that is, a…
Packing six T-joins in plane graphs
Zdenek Dvorak, Ken-ichi Kawarabayashi, Daniel Kral
Let G be a plane graph and T an even subset of its vertices. It has been conjectured that if all T-cuts of G have the same parity and the size of every T-cut is at least k, then G…
The Erdös-Pósa property for clique minors in highly connected graphs
Reinhard Diestel, Ken-ichi Kawarabayashi, Paul Wollan
We prove the existence of a function f: N^2 -> N such that for all p,k in N every (k(p-3) + 14p+14) - connected graph either has k disjoint K_p minors or contains a set of at most…