15 citations · 34 across the 12 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
Disjoint dijoins for classes of dicuts in finite and infinite digraphs
J. Pascal Gollin, Karl Heuer, Konstantinos Stavropoulos
A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the cut. A famous theorem of Lucchesi and Younger states that in every finite digra…
math.CO2021
Hamilton-laceable bi-powers of locally finite bipartite graphs
Karl Heuer
In this paper we strengthen a result due to Li by showing that the third bi-power of a locally finite connected bipartite graph that admits a perfect matching is Hamilton-laceable,…