Hamburg papers on
Extremal infinite graph theory

An analogue of Edmonds' Branching Theorem for infinite digraphs
(J.P. Gollin & K. Heuer),
preprint 2018;
ArXiv

Hamilton cycles in infinite cubic graphs
(M. Pitz),
Electron. J. Comb. 25 (2018), #P3.3
ArXiv

Hamiltonicity in locally finite graphs: two extensions and a counterexample
(K. Heuer),
Electron. J. Comb. 25 (2018), #P3.13;
PDF

Contractible edges in 2connected locally finite graphs
(Tsz Lung Chan),
Electronic J. Comb 22 (2015) #P2.47;
PDF

A sufficient local degree condition for the hamiltonicity of locally finite clawfree graphs
(K. Heuer),
Europ. J. Comb. 55 (2016), 8299;
PDF

Extending cycles locally to Hamilton cycles
(M. Hamann, F. Lehner, J. Pott),
Electron. J. Combin. 23 (2016), #P1.49;
PDF

A sufficient condition for Hamiltonicity in locally finite graphs
(K. Heuer),
Europ. J. Combinatorics 45 (2015), 97114;
PDF

Forcing finite minors in sparse infinite graphs by largedegree assumptions
(R. Diestel),
Electronic J. Combinatorics 22 (2015), #P1.43;
PDF

Extremal infinite graph theory (survey)
(M. Stein),
Infinite Graph Theory special volume of Discrete Math. 311 (2011), 1472–1496;
PDF

Ends and vertices of small degree in infinite minimally k(edge)connected graphs
(M. Stein),
SIAM J. Discrete Math. 24(2010), 1584–1596;
PDF

Infinite Hamilton cycles in squares of locally finite graphs
(A. Georgakopoulos),
Advances Math., 220 (2009), 670705;
PDF

Forcing highly connected subgraphs in locally finite graphs
(M. Stein),
J. Graph Theory 54 (2007), 331349;
PDF

Arboriticity and treepacking in locally finite graphs
(M. Stein),
J. Combin. Theory (Series B) 96 (2006), 302312;
PDF

Hamilton cycles in planar locally finite graphs
(H. Bruhn & X. Yu),
SIAM. J. Discrete Math. 22 (2008), 13811392;
PDF
Theses:

Connectivity in directed and undirected infinite graphs
(K. Heuer),
PhD dissertation, Hamburg 2018;
PDF