20 Result(s)

Article

On vertex transitive graphs of infinite degree

R. Diestel, H. A. Jung, R. G. Möller in Archiv der Mathematik (1993)

Article

Long paths and cycles in tough graphs

For a graphG, letp(G) andc(G) denote the length of a longest path and cycle, respectively. Let π(t,n) be the minimum ofp(G), whereG ranges over allt-tough connected graphs onn vertices. Similarly, let γ(t,n) be t...

H. J. Broersma, J. van den Heuvel, H. A. Jung, H. J. Veldman in Graphs and Combinatorics (1993)

Chapter

Long Cycles in Graphs with Moderate Connectivity

In this paper we supply bounds for the length of a longest cycle C in G in terms of the structure of G-V(C).

H. A. Jung in Topics in Combinatorics and Graph Theory (1990)

Article

The connectivities of locally finite primitive graphs

Letγ be an infinite, locally finite graph whose automorphism group is primitive on its vertex set. It is shown that the connectivity ofγ cannot equal 2, but all other values 0, 1, 3, 4, ... are possible.

H. A. Jung, M. E. Watkins in Combinatorica (1989)

Article

Longest paths joining given vertices in a graph

H. A. Jung in Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (1986)

Article

On 3-skein isomorphisms of graphs

It is shown that a 3-skein isomorphism between 3-connected graphs with at least 5 vertices is induced by an isomorphism. These graphs have no loops but may be infinite and have multiple edges.

H. A. Jung, A. K. Kelmans, R. L. Hemminger in Combinatorica (1982)

Article

Note on 2-connected graphs withd(u)+d (v)≧n −4

H. A. Jung, C. Nara in Archiv der Mathematik (1982)

Article

A note on fragments of infinite graphs

Results involving automorphisms and fragments of infinite graphs are proved. In particular for a given fragmentC and a vertex-transitive subgroupG of the automorphism group of a connected graph there exists σ≠G s...

H. A. Jung in Combinatorica (1981)

Article

On the connectivities of finite and infinite graphs

Results byW. Mader and the authors on the connectivity of finite graphs are generalized to include infinite graphs. In the infinite case a distinction must be made concerning the distribution of finite and infini...

H. A. Jung, M. E. Watkins in Monatshefte für Mathematik (1977)

Article

Über den Zusammenhang von Graphen, mit Anwendungen auf symmetrische Graphen

H. A. Jung in Mathematische Annalen (1973)

Article

Abschließungen in Klassen strukturierter Mengen

K. Dörge, H. A. Jung in Mathematische Annalen (1970)

Article

Eine Verallgemeinerung desn-fachen Zusammenhangs für Graphen

H. A. Jung in Mathematische Annalen (1970)

Article

On odd circuits in chromatic graphs

W. G. Brown, H. A. Jung in Acta Mathematica Academiae Scientiarum Hungarica (1969)

Article

Über die Seltenheit der reduziblen Polynome

K. Dörge, H. A. Jung in Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (1968)

Article

Zu einem Isomorphiesatz von H. Whitney für Graphen

H. A. Jung in Mathematische Annalen (1966)

Article

Anwendung einer Methode von K. Wagner bei Färbungsproblemen für Graphen

H. A. Jung in Mathematische Annalen (1965)

Article

Charakterisierung der Komplexe der Ebene und der 2-Sphäre

R. Halin, H. A. Jung in Archiv der Mathematik (1964)

Article

Maximal-Г-prime Graphen

H. A. Jung in Mathematische Annalen (1964)

Article

Über Minimalstrukturen von Graphen, insbesondere vonn-fach zusammenhängenden Graphen

R. Halin, H. A. Jung in Mathematische Annalen (1963)