5 papers
Torsoids in Path-Like Graphs without nontrivial even 2-separation
Nathan Bowler, Florian Reich, Qiuzhenyu Tao
Bowler et al. introduced the concept of torsoids that describes the 1-separations of a directed graph in a canonical way building on previous progress by Lov{á}sz. To fully unders…
Connectoids II: existence of normal trees
Nathan Bowler, Florian Reich
In this series, we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects such as undirected graphs, directed g…
A structure theorem for rooted connectivity in bidirected graphs
Tara Abrishami, Nathan Bowler, Attila Joó +2
Recently, bidirected graphs have received increasing attention from the graph theory community with both structural and algorithmic results. Bidirected graphs are a generalization…
Normal trees of digraphs
Florian Reich
In this paper, we investigate normal trees of directed graphs, which extend the fundamental concept of normal trees of undirected graphs. We prove that a directed graph has a n…
Connectoids I: a universal end space theory
Nathan Bowler, Florian Reich
In this series we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects like undirected graphs, directed graph…