𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The connectivities of locally finite primitive graphs

✍ Scribed by H. A. Jung; M. E. Watkins

Publisher
Springer-Verlag
Year
1989
Tongue
English
Weight
392 KB
Volume
9
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the hamiltonicity of line graphs of l
On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs
✍ Richard C. Brewster; Daryl Funk πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 124 KB

## Abstract The topological approach to the study of infinite graphs of Diestel and KÜhn has enabled several results on Hamilton cycles in finite graphs to be extended to locally finite graphs. We consider the result that the line graph of a finite 4‐edge‐connected graph is hamiltonian. We prove a

Decomposing Ends of Locally Finite Graph
Decomposing Ends of Locally Finite Graphs
✍ Heinz Adolf Jung; Peter Niemeyer πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 905 KB

An important invariant of translations of infinite locally finite graphs is that of a direction as introduced by HALIN. This invariant gives not much information if the translation is not a proper one. A new refined concept of directions is investigated. A double ray D of a graph X is said to be me

On local connectivity of graphs
On local connectivity of graphs
✍ Lutz Volkmann πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 151 KB

The local connectivity ΞΊ(u, v) of two vertices u and v in a graph G is the maximum number of internally disjoint u-v paths in G, and the connectivity of G is defined as } for all pairs u and v of vertices in G. Let Ξ΄(G) be the minimum degree of G. We call a graph G maximally connected when ΞΊ(G) = Ξ΄