31 citations · 256 across the 67 of their papers we have counts for
1 paper · 1 filter
Zdeněk Dvořák
We show that if an n-vertex 5-connected graph has at least 4n-10 edges, then for any choice of five of its vertices, we can contract disjoint connected subgraphs containing these v…