1 citations · 3 across the 4 of their papers we have counts for
4 papers
Ends of digraphs I: basic theory
Carl Bürger, Ruben Melcher
In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. U…
Ends of digraphs II: the topological point of view
Carl Bürger, Ruben Melcher
In a series of three papers we develop an end space theory for digraphs. Here in the second paper we introduce the topological space formed by a digraph together with its…
Ends of digraphs III: normal arborescences
Carl Bürger, Ruben Melcher
In a series of three papers we develop an end space theory for digraphs. Here in the third paper we introduce a concept of depth-first search trees in infinite digraphs, which we c…
Decomposing edge-coloured complete symmetric digraphs into monochromatic paths
Carl Bürger, Max Pitz
Confirming and extending a conjecture by Guggiari, we show that every countable -edge-coloured complete symmetric digraph containing no directed paths of edge-length $\ell_i…