default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMax Pitz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j23]Amena Assem, Marcel Koloschin, Max Pitz:
The Nash-Williams orientation theorem for graphs with countably many ends. Eur. J. Comb. 124: 104043 (2025)- 2024
- [j22]Thilo Krill, Max Pitz:
The Number of Topological Types of Trees. Comb. 44(3): 651-657 (2024) - [j21]Max Pitz
:
Applications of Order Trees in Infinite Graphs. Order 41(1): 65-81 (2024) - 2023
- [j20]Marcel Koloschin, Thilo Krill, Max Pitz:
End spaces and tree-decompositions. J. Comb. Theory B 161: 147-179 (2023) - [j19]Max Pitz:
A note on minor antichains of uncountable graphs. J. Graph Theory 102(3): 552-555 (2023) - [j18]Nathan J. Bowler, Christian Elbracht, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen:
Ubiquity of graphs with nowhere-linear end structure. J. Graph Theory 103(3): 564-598 (2023) - [j17]Nathan J. Bowler, Florian Gut, Attila Joó, Max Pitz:
Maker-Breaker Games on and. J. Symb. Log. 88(2): 697-703 (2023) - 2022
- [j16]Max Pitz:
Constructing Tree-Decompositions That Display All Topological Ends. Comb. 42(5): 763-769 (2022) - [j15]Nathan J. Bowler, Christian Elbracht, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen:
Topological ubiquity of trees. J. Comb. Theory B 157: 70-95 (2022) - 2021
- [j14]Joshua Erde, J. Pascal Gollin, Attila Joó, Paul Knappe, Max Pitz:
Base Partition for Mixed Families of Finitary and Cofinitary Matroids. Comb. 41(1): 31-52 (2021) - [j13]Max Pitz:
Quickly Proving Diestel's Normal Spanning Tree Criterion. Electron. J. Comb. 28(3) (2021) - [j12]Jan Kurkofka, Max Pitz:
Tangles and the Stone-Čech compactification of infinite graphs. J. Comb. Theory B 146: 34-60 (2021) - [j11]Jan Kurkofka, Ruben Melcher, Max Pitz:
Approximating infinite graphs by normal trees. J. Comb. Theory B 148: 173-183 (2021) - [j10]Joshua Erde, J. Pascal Gollin, Attila Joó, Paul Knappe, Max Pitz:
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs. J. Comb. Theory B 149: 16-22 (2021) - [j9]Nathan J. Bowler, Joshua Erde, Florian Lehner, Max Pitz:
Bounding the Cop Number of a Graph by Its Genus. SIAM J. Discret. Math. 35(4): 2459-2489 (2021) - 2020
- [j8]Joshua Erde, Florian Lehner, Max Pitz:
Hamilton decompositions of one-ended Cayley graphs. J. Comb. Theory, Ser. B 140: 171-191 (2020) - [j7]Max Pitz:
A unified existence theorem for normal spanning trees. J. Comb. Theory B 145: 466-469 (2020) - [j6]Paul Knappe, Max Pitz:
Circuits through prescribed edges. J. Graph Theory 93(4): 470-482 (2020) - [j5]Benjamin Espinoza, Paul Gartside, Max Pitz:
Graph-like compacta: Characterizations and Eulerian loops. J. Graph Theory 95(2): 209-239 (2020)
2010 – 2019
- 2018
- [j4]Max Pitz:
Hamilton Cycles in Infinite Cubic Graphs. Electron. J. Comb. 25(3): 3 (2018) - [j3]Carl Bürger, Louis DeBiasio, Hannah Guggiari, Max Pitz:
Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs. Discret. Math. 341(11): 3134-3140 (2018) - [j2]Nathan J. Bowler, Joshua Erde, Peter Heinig, Florian Lehner, Max Pitz:
Non-reconstructible locally finite graphs. J. Comb. Theory B 133: 122-152 (2018) - 2017
- [j1]Nathan J. Bowler, Joshua Erde, Florian Lehner, Martin Merker, Max Pitz, Konstantinos S. Stavropoulos:
A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs. Discret. Appl. Math. 229: 151-153 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 20:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
