A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs. - Nathan J. Bowler; Joshua Erde; Florian Lehner; Martin Merker; Max Pitz; Konstantinos S. Stavropoulos (Discret. Appl. Math., 2017)

Hamilton Cycles in Infinite Cubic Graphs. - Max Pitz (Electron. J. Comb., 2018)

Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs. - Carl Bürger; Louis DeBiasio; Hannah Guggiari; Max Pitz (Discret. Math., 2018)

Non-reconstructible locally finite graphs. - Nathan J. Bowler; Joshua Erde; Peter Heinig; Florian Lehner; Max Pitz (J. Comb. Theory B, 2018)

Hamilton decompositions of one-ended Cayley graphs. - Joshua Erde; Florian Lehner; Max Pitz (J. Comb. Theory, Ser. B, 2020)

A unified existence theorem for normal spanning trees. - Max Pitz (J. Comb. Theory B, 2020)

Graph-like compacta: Characterizations and Eulerian loops. - Benjamin Espinoza; Paul Gartside; Max Pitz (J. Graph Theory, 2020)

Circuits through prescribed edges. - Paul Knappe; Max Pitz (J. Graph Theory, 2020)

Base Partition for Mixed Families of Finitary and Cofinitary Matroids. - Joshua Erde; J. Pascal Gollin; Attila Joó; Paul Knappe; Max Pitz (Comb., 2021)

Quickly Proving Diestel's Normal Spanning Tree Criterion. - Max Pitz (Electron. J. Comb., 2021)

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs. - Joshua Erde; J. Pascal Gollin; Attila Joó; Paul Knappe; Max Pitz (J. Comb. Theory B, 2021)

Approximating infinite graphs by normal trees. - Jan Kurkofka; Ruben Melcher; Max Pitz (J. Comb. Theory B, 2021)

Tangles and the Stone-Čech compactification of infinite graphs. - Jan Kurkofka; Max Pitz (J. Comb. Theory B, 2021)

Bounding the Cop Number of a Graph by Its Genus. - Nathan J. Bowler; Joshua Erde; Florian Lehner; Max Pitz (SIAM J. Discret. Math., 2021)

Constructing Tree-Decompositions That Display All Topological Ends. - Max Pitz (Comb., 2022)

Topological ubiquity of trees. - Nathan J. Bowler; Christian Elbracht; Joshua Erde; J. Pascal Gollin; Karl Heuer; Max Pitz; Maximilian Teegen (J. Comb. Theory B, 2022)

A note on minor antichains of uncountable graphs. - Max Pitz (J. Graph Theory, 2023)

Maker-Breaker Games on and. - Nathan J. Bowler; Florian Gut; Attila Joó; Max Pitz (J. Symb. Log., 2023)

End spaces and tree-decompositions. - Marcel Koloschin; Thilo Krill; Max Pitz (J. Comb. Theory B, 2023)

Ubiquity of graphs with nowhere-linear end structure. - Nathan J. Bowler; Christian Elbracht; Joshua Erde; J. Pascal Gollin; Karl Heuer; Max Pitz; Maximilian Teegen (J. Graph Theory, 2023)

Ubiquity of locally finite graphs with extensive tree-decompositions. - Nathan J. Bowler; Christian Elbracht; Joshua Erde; J. Pascal Gollin; Karl Heuer; Max Pitz; Maximilian Teegen (Comb. Theory, 2024)

Applications of Order Trees in Infinite Graphs. - Max Pitz (Order, 2024)

The Number of Topological Types of Trees. - Thilo Krill; Max Pitz (Comb., 2024)

A Note on Uncountably Chromatic Graphs. - Nathan J. Bowler; Max Pitz (Electron. J. Comb., 2025)

The Nash-Williams orientation theorem for graphs with countably many ends. - Amena Assem; Marcel Koloschin; Max Pitz (Eur. J. Comb., 2025)