Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Jung, H.A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Longest cycles in tough graphs
H.A. Jung
,
P. Wittmann
Journal of Graph Theory
31
(2), 1999, pp. 107-127
Long paths and cycles in tough graphs
H.J. Broersma
,
J. van den Heuvel
,
H.A. Jung
,
H.J. Veldman
Graphs and Combinatorics
9
, 1993, pp. 3-17
Cycles containing all vertices of maximum degree
H.J. Broersma
,
J. van den Heuvel
,
H.A. Jung
,
H.J. Veldman
Journal of Graph Theory
17
(3), 1993, pp. 373-385
Finite separating sets in locally finite graphs
H.A. Jung
,
Mark E. Watkins
Journal of Combinatorial Theory Series B
59
(1), 1993, pp. 15-25
The connectivities of locally finite primitive graphs
H.A. Jung
,
M.E. Watkins
Combinatorica
9
(3), 1989, pp. 261-267
On 3-skein isomorphisms of graphs
R.L. Hemminger
,
H.A. Jung
,
A.K. Kelmans
Combinatorica
2
, 1982, pp. 373-376
On
n
-Skein isomorphisms of graphs
R.L. Hemminger
,
H.A. Jung
Journal of Combinatorial Theory Series B
32
(2), 1982, April, pp. 103-111
A note on fragments of infinite graphs
H.A. Jung
Combinatorica
1
, 1981, pp. 285-288
On a class of posets and the corresponding comparability graphs
H.A. Jung
Journal of Combinatorial Theory Series B
24
(2), 1978, April, pp. 125-133
The square of a block is Hamiltonian connected
G. Chartrand
,
Arthur M. Hobbs
,
H.A. Jung
,
S.F. Kapoor
,
C.St.J.A. Nash-Williams
Journal of Combinatorial Theory Series B
16
, 1974, pp. 290-292