Heinz Adolf Jung

19 papers Journal 17Unranked 2
YearRankTypeTitle / Venue / Authors
2005 J jnl
Degree bounds for the circumference of 3-connected graphs.
J. Graph Theory
Heinz Adolf Jung, Elkin Vumar
2005 J jnl
Some degree bounds for the circumference of graphs.
Discret. Math.
Elkin Vumar, Heinz Adolf Jung
2001 — conf
Degree Bounds for Long Paths and Cycles in k-Connected Graphs.
Computational Discrete Mathematics
Heinz Adolf Jung
1999 J jnl
Longest cycles in tough graphs.
J. Graph Theory
Heinz Adolf Jung, P. Wittmann
1994 J jnl
On finite fixed sets in infinite graphs.
Discret. Math.
Heinz Adolf Jung
1993 J jnl
Cycles containing all vertices of maximum degree.
J. Graph Theory
Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman
1993 J jnl
Finite Separating Sets in Locally Finite Graphs.
J. Comb. Theory B
Heinz Adolf Jung, Mark E. Watkins
1993 J jnl
Long paths and cycles in tough graphs.
Graphs Comb.
Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman
1991 J jnl
Hamiltonism, degree sum and neighborhood intersections.
Discret. Math.
Evelyne Flandrin, Heinz Adolf Jung, Hao Li
1991 — conf
Notes on rays and automorphisms of locally finite graphs.
Graph Structure Theory
Heinz Adolf Jung
1991 J jnl
Some results on ends and automorphisms of graphs.
Discret. Math.
Heinz Adolf Jung
1989 J jnl
The connectivities of locally finite primitive graphs.
Comb.
Heinz Adolf Jung, Mark E. Watkins
1984 J jnl
Fragments and Automorphisms of Infinite Graphs.
Eur. J. Comb.
Heinz Adolf Jung, Mark E. Watkins
1982 J jnl
On
J. Comb. Theory B
Robert L. Hemminger, Heinz Adolf Jung
1982 J jnl
On 3-skein isomorphisms of graphs.
Comb.
Robert L. Hemminger, Heinz Adolf Jung, Alexander K. Kelmans
1981 J jnl
A note on fragments of infinite graphs.
Comb.
Heinz Adolf Jung
1978 J jnl
On a class of posets and the corresponding comparability graphs.
J. Comb. Theory B
Heinz Adolf Jung
1977 J jnl
On the structure of infinite vertex-transitive graphs.
Discret. Math.
Heinz Adolf Jung, Mark E. Watkins
1974 J jnl
Über die Bestimmung minimaler Wege und Gerüste in Graphen.
Computing
Heinz Adolf Jung