3 citations · 13 across the 8 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2021
Disjoint Paths and Connected Subgraphs for H-Free Graphs
Walter Kern, Barnaby Martin, Daniël Paulusma +2
The well-known Disjoint Paths problem is to decide if a graph contains k pairwise disjoint paths, each connecting a different terminal pair from a set of k distinct pairs. We deter…
math.CO2012
Max-Flow on Regular Spaces
Ulrich Faigle, Walter Kern, Britta Peis
The max-flow and max-coflow problem on directed graphs is studied in the common generalization to regular spaces, i.e., to kernels or row spaces of totally unimodular matrices. Exh…