papers
Publications (14)
math.CO2018
Ubiquity in graphs I: Topological ubiquity of trees
Nathan Bowler, Christian Elbracht, Joshua Erde +4
math.CO2018
n-Arc Connected Graphs
Paul Gartside, Ana Mamatelashvili, Max Pitz
math.CO2018
Partitioning Edge-Coloured Complete Symmetric Digraphs into Monochromatic Complete Subgraphs
Carl Bürger, Louis DeBiasio, Hannah Guggiari +1
math.CO2018
Non-reconstructible locally finite graphs
Nathan Bowler, Joshua Erde, Peter Heinig +2
math.CO2018
A counterexample to the reconstruction conjecture for locally finite trees
Nathan Bowler, Joshua Erde, Peter Heinig +2
math.CO2017
A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs
Nathan Bowler, Joshua Erde, Florian Lehner +3
math.CO2017
Minimal obstructions for normal spanning trees
Nathan Bowler, Stefan Geschke, Max Pitz
math.CO2016
Graph-Like Compacta: Characterizations and Eulerian Loops
Benjamin Espinoza, Paul Gartside, Max Pitz
math.CO2017
Hamilton decompositions of one-ended Cayley graphs
Joshua Erde, Florian Lehner, Max Pitz
math.CO2018
Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths
Carl Bürger, Max Pitz
math.CO2018
Ends, tangles and critical vertex sets
Jan Kurkofka, Max Pitz
math.CO2017
Decomposing edge-coloured complete symmetric digraphs into monochromatic paths
Carl Bürger, Max Pitz
math.CO2017
Hamilton cycles in infinite cubic graphs
Max Pitz
math.CO2018
$n$-arc and $n$-circle connected graph-like spaces
Paul Gartside, Max Pitz