Max Pitz

Orcid: 0000-0001-8961-6132

According to our database1, Max Pitz authored at least 20 papers between 2017 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Ubiquity of graphs with nowhere-linear end structure.
J. Graph Theory, July, 2023

End spaces and tree-decompositions.
J. Comb. Theory, Ser. B, July, 2023

Maker-Breaker Games on and.
J. Symb. Log., 2023

A note on minor antichains of uncountable graphs.
J. Graph Theory, 2023

2022
Topological ubiquity of trees.
J. Comb. Theory, Ser. B, 2022

Constructing Tree-Decompositions That Display All Topological Ends.
Comb., 2022

2021
Bounding the Cop Number of a Graph by Its Genus.
SIAM J. Discret. Math., 2021

Tangles and the Stone-Čech compactification of infinite graphs.
J. Comb. Theory, Ser. B, 2021

Approximating infinite graphs by normal trees.
J. Comb. Theory, Ser. B, 2021

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs.
J. Comb. Theory, Ser. B, 2021

Quickly Proving Diestel's Normal Spanning Tree Criterion.
Electron. J. Comb., 2021

Base Partition for Mixed Families of Finitary and Cofinitary Matroids.
Comb., 2021

2020
Circuits through prescribed edges.
J. Graph Theory, 2020

Graph-like compacta: Characterizations and Eulerian loops.
J. Graph Theory, 2020

A unified existence theorem for normal spanning trees.
J. Comb. Theory, Ser. B, 2020

Hamilton decompositions of one-ended Cayley graphs.
J. Comb. Theory, Ser. B, 2020

2018
Non-reconstructible locally finite graphs.
J. Comb. Theory, Ser. B, 2018

Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs.
Discret. Math., 2018

Hamilton Cycles in Infinite Cubic Graphs.
Electron. J. Comb., 2018

2017
A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs.
Discret. Appl. Math., 2017


  Loading...