• Infinite grids in digraphs (M. Hamann, K. Heuer), preprint 2024; ArXiv
• An end degree for digraphs (M. Hamann, K. Heuer), preprint 2024; ArXiv
• Halin's grid theorem for digraphs (F. Reich), preprint 2024; ArXiv
• Normal trees of digraphs (F. Reich), preprint 2024; ArXiv
• Hindrance from a wasteful partial linkage (A. Joó), preprint 2024; ArXiv
• A star-comb lemma for infinite digraphs (F. Reich), preprint 2024; ArXiv
• A star-comb lemma for finite digraphs (F. Reich), preprint 2024; ArXiv
• Connectoids II: existence of normal trees (N. Bowler, F. Reich), preprint 2024; ArXiv
• Connectoids I: a universal end space theory (N. Bowler, F. Reich), preprint 2024; ArXiv
• The Nash-Williams orientation theorem for graphs with countably many ends (A. Assem, M. Koloschin and M. Pitz), submitted. (ArXiv).
• Decomposition of (infinite) digraphs along directed 1-separations (N. Bowler, F. Gut, M. Hatzel, K.-i. Kawarabayashi, I. Muzi and F. Reich), preprint 2023; ArXiv
• On the ubiquity of oriented double rays (F. Gut, T. Krill and F. Reich), preprint 2023; ArXiv
• Ubiquity of oriented rays (F. Gut, T. Krill and F. Reich), Journal of Graph Theory 107(1) (2024), 200-211; ArXiv
• Large vertex-flames in uncountable digraphs (F. Gut & A. Joó), Israel Journal of Mathematics (2023); ArXiv
• Hamiltonicity in infinite tournaments (Ruben Melcher), preprint 2021; ArXiv
• Ends of digraphs III: normal arborescences (Carl Bürger, Ruben Melcher), preprint 2020; ArXiv
• Ends of digraphs II: the topological point of view (Carl Bürger, Ruben Melcher), preprint 2020; ArXiv
• Ends of digraphs I: basic theory (Carl Bürger, Ruben Melcher), preprint 2020; ArXiv
• Enlarging vertex-flames in countable digraphs (J. Erde, J. P. Gollin, A. Joó), Journal of Combinatorial Theory, Series B, Volume 151, November 2021, Pages 263-281; open access
• On the infinite Lucchesi-Younger conjecture I (J.P. Gollin & K. Heuer), Journal of Graph Theory 98.1 (2021), 27-48; ArXiv
• Reducing the dichromatic number via cycle reversions in infinite digraphs (P. Ellis, A. Joó, D. T. Soukup), European Journal of Combinatorics, Volume 90, Pages 103196, 2020; open access
• On the growth rate of dichromatic numbers of finite subdigraphs (A. Joó), Discrete Mathematics, Volume 343, Issue 3, 2019; open access
• Uncountable dichromatic number without short directed cycles (A. Joó), Journal of Graph Theory, Volume 94, Issue 1, Pages 113-116, 2020; open access
• The Complete Lattice of Erdős-Menger Separations (A. Joó), preprint 2019; ArXiv
• Vertex-flames in countable rooted digraphs preserving an Erdős-Menger separation for each vertex (A. Joó), Combinatorica, V. 39, P. 1317-1333, 2019; ArXiv
• An analogue of Edmonds' Branching Theorem for infinite digraphs (J.P. Gollin & K. Heuer), Europ. J. Comb 92. 2021; ArXiv
• Countable Menger's Theorem with Finitary Matroid Constraints on the Ingoing Edges (A. Joó), Electr. J. Comb., Volume 25, Issue 3, 2018; open access
• Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs (C. Bürger, L. DeBiasio, H. Guggiari, M. Pitz), Discrete Math. 341 (2018), 3134-3140; ArXiv
• Decomposing edge-coloured complete symmetric digraphs into monochromatic paths (C. Bürger, M. Pitz), preprint 2017; ArXiv
• Packing countably many branchings with prescribed root-sets in infinite digraphs (A. Joó), Journal of Graph Theory, V. 87, Num. 1, P. 96-107, 2017; Journal
• Highly Connected Infinite Digraphs Without Edge-Disjoint Back and Forth Paths Between a Certain Vertex Pair (A. Joó), Journal of Graph Theory, Volume 85, Number 1, Pages 51-55, 2017; ArXiv
• Edmonds' branching theorem in digraphs without forward-infinite paths (A. Joó), Journal of Graph Theory, Volume 83, Number 3, Pages 303-311, 2016; ArXiv
• On partitioning the edges of an infinite digraph into directed cycles (A. Joó), Advances in Combinatorics 2021; open access

Theses:

• Ubiquity, hamiltonicity and dijoins in graphs (K.M. Heuer), Habilitationsschrift, Hamburg 2022; PDF
• Connectivity in directed and undirected infinite graphs (K. Heuer), PhD dissertation, Hamburg 2018; PDF
• Decomposing edge-coloured infinite graphs into monochromatic paths and cycles (C. Bürger), MSc dissertation, Hamburg 2017; PDF