Über die Bestimmung minimaler Wege und Gerüste in Graphen. - Heinz Adolf Jung (Computing, 1974)

On the structure of infinite vertex-transitive graphs. - Heinz Adolf Jung; Mark E. Watkins (Discret. Math., 1977)

On a class of posets and the corresponding comparability graphs. - Heinz Adolf Jung (J. Comb. Theory B, 1978)

A note on fragments of infinite graphs. - Heinz Adolf Jung (Comb., 1981)

On 3-skein isomorphisms of graphs. - Robert L. Hemminger; Heinz Adolf Jung; Alexander K. Kelmans (Comb., 1982)

On n-skein isomorphisms of graphs. - Robert L. Hemminger; Heinz Adolf Jung (J. Comb. Theory B, 1982)

Fragments and Automorphisms of Infinite Graphs. - Heinz Adolf Jung; Mark E. Watkins (Eur. J. Comb., 1984)

The connectivities of locally finite primitive graphs. - Heinz Adolf Jung; Mark E. Watkins (Comb., 1989)

Notes on rays and automorphisms of locally finite graphs. - Heinz Adolf Jung (Graph Structure Theory, 1991)

Hamiltonism, degree sum and neighborhood intersections. - Evelyne Flandrin; Heinz Adolf Jung; Hao Li 002 (Discret. Math., 1991)

Some results on ends and automorphisms of graphs. - Heinz Adolf Jung (Discret. Math., 1991)

Long paths and cycles in tough graphs. - Haitze J. Broersma; Jan van den Heuvel; Heinz Adolf Jung; Henk Jan Veldman (Graphs Comb., 1993)

Finite Separating Sets in Locally Finite Graphs. - Heinz Adolf Jung; Mark E. Watkins (J. Comb. Theory B, 1993)

Cycles containing all vertices of maximum degree. - Haitze J. Broersma; Jan van den Heuvel; Heinz Adolf Jung; Henk Jan Veldman (J. Graph Theory, 1993)

On finite fixed sets in infinite graphs. - Heinz Adolf Jung (Discret. Math., 1994)

Longest cycles in tough graphs. - Heinz Adolf Jung; P. Wittmann (J. Graph Theory, 1999)

Degree Bounds for Long Paths and Cycles in k-Connected Graphs. - Heinz Adolf Jung (Computational Discrete Mathematics, 2001)

Some degree bounds for the circumference of graphs. - Elkin Vumar; Heinz Adolf Jung (Discret. Math., 2005)

Degree bounds for the circumference of 3-connected graphs. - Heinz Adolf Jung; Elkin Vumar (J. Graph Theory, 2005)