𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line

✍ Scribed by Ye. Dinitz; J. Westbrook

Publisher
Springer
Year
1998
Tongue
English
Weight
677 KB
Volume
20
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the edge-connectivity vector of a gra
On the edge-connectivity vector of a graph
✍ Linda M. Lesniak; Raymond E. Pippert πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 202 KB
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

On the extremal number of edges in hamil
On the extremal number of edges in hamiltonian connected graphs
✍ Tung-Yang Ho; Cheng-Kuan Lin; Jimmy J.M. Tan; D. Frank Hsu; Lih-Hsing Hsu πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 421 KB

a b s t r a c t Assume that n and Ξ΄ are positive integers with 3 ≀ Ξ΄ < n. Let hc(n, Ξ΄) be the minimum number of edges required to guarantee an n-vertex graph G with minimum degree Ξ΄(G) β‰₯ Ξ΄ to be hamiltonian connected.