15 citations · 28 across the 5 of their papers we have counts for
12 papers
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…
Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive tree-decompositions
Nathan Bowler, Christian Elbracht, Joshua Erde +4
A graph is said to be ubiquitous, if every graph that contains arbitrarily many disjoint -minors automatically contains infinitely many disjoint -minors. The well-kno…
Even Circuits in Oriented Matroids
Karl Heuer, Raphael Steiner, Sebastian Wiederrecht
In this paper we generalise the even directed cycle problem, which asks whether a given digraph contains a directed cycle of even length, to orientations of regular matroids. We de…
Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs II: paws
Karl Heuer, Deniz Sarikaya
In this paper we extend a result about a sufficient condition for Hamiltonicity for finite graphs by Broersma and Veldmann to locally finite graphs. In order to do this we use topo…
Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: nets and bulls
Karl Heuer, Deniz Sarikaya
In a series of papers, of which this is the first, we study sufficient conditions for Hamiltonicity in terms of forbidden induced subgraphs and extend such results to locally finit…
On the Infinite Lucchesi-Younger Conjecture I
J. Pascal Gollin, Karl Heuer
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…