𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on locally connected and hamiltonian-connected graphs

✍ Scribed by Gary Chartrand; Ronald J. Gould; Albert D. Polimeni

Book ID
112885318
Publisher
The Hebrew University Magnes Press
Year
1979
Tongue
English
Weight
180 KB
Volume
33
Category
Article
ISSN
0021-2172

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On hamiltonian-connected graphs
On hamiltonian-connected graphs
✍ Ronald J. Gould; Xingxing Yu πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 735 KB

## Abstract One of the most fundamental results concerning paths in graphs is due to Ore: In a graph __G__, if deg __x__ + deg __y__ ≧ |__V__(__G__)| + 1 for all pairs of nonadjacent vertices __x, y__ β‰… __V__(__G__), then __G__ is hamiltonian‐connected. We generalize this result using set degrees.

Hamiltonian N2-locally connected claw-fr
Hamiltonian N2-locally connected claw-free graphs
✍ Hong-Jian Lai; Yehong Shao; Mingquan Zhan πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 63 KB πŸ‘ 1 views

A graph G is N 2 -locally connected if for every vertex v in G, the edges not incident with v but having at least one end adjacent to v in G induce a connected graph. In 1990, Ryja Β΄c Λ‡ek conjectured that every 3-connected N 2 -locally connected claw-free graph is Hamiltonian. This conjecture is pro

On Hamiltonian-connected regular graphs
On Hamiltonian-connected regular graphs
✍ Ioan Tomescu πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 360 KB πŸ‘ 1 views

In this paper it is shown that any rn-regular graph of order 2rn (rn 3 3), not isomorphic to K, , , , or of order 2rn + 1 (rn even, rn 3 4), is Hamiltonian connected, which extends a previous result of Nash-Williams. As a corollary, it is derived that any such graph contains at least rn Hamiltonian

Hamiltonian circuits in N2-locally conne
Hamiltonian circuits in N2-locally connected K1,3-free graphs
✍ ZdenΔ›K RyjÑček πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 407 KB πŸ‘ 1 views

## Abstract There are many results concerned with the hamiltonicity of __K__~1,3~‐free graphs. In the paper we show that one of the sufficient conditions for the __K__~1,3~‐free graph to be Hamiltonian can be improved using the concept of second‐type vertex neighborhood. The paper is concluded with

On 3-connected hamiltonian line graphs
On 3-connected hamiltonian line graphs
✍ Ye Chen; Suohai Fan; Hong-Jian Lai πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 223 KB