𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Every 3-connected, essentially 11-connected line graph is Hamiltonian

✍ Scribed by Hong-Jian Lai; Yehong Shao; Hehui Wu; Ju Zhou

Book ID
108167401
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
89 KB
Volume
96
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Every 3-connected claw-free Z8-free grap
Every 3-connected claw-free Z8-free graph is Hamiltonian
✍ Hong-Jian Lai; Liming Xiong; Huiya Yan; Jin Yan πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 115 KB πŸ‘ 2 views

## Abstract In this article, we first show that every 3‐edge‐connected graph with circumference at most 8 is supereulerian, which is then applied to show that a 3‐connected claw‐free graph without __Z__~8~ as an induced subgraph is Hamiltonian, where __Z__~8~ denotes the graph derived from identify

Every 3-connected, locally connected, cl
Every 3-connected, locally connected, claw-free graph is Hamilton-connected
✍ Asratian, A. S. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 639 KB

A graph G is locally connected if the subgraph induced by the neighbourhood of each vertex is connected. We prove that a locally connected graph G of orderp 2 4, containing no induced subgraph isomorphic to K1,31 is Hamilton-connected if and only if G is 3connected.

Every connected, locally connected nontr
Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
✍ David J. Oberly; Slobodan K. SimiΔ‡; David P. Sumner πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 232 KB

## Abstract A graph is locally connected if every neighborthood induces a connected subgraph. We show here that every connected, locally connected graph on __p__ β‰₯ 3 vertices and having no induced __K__~1,3~ is Hamiltonian. Several sufficient conditions for a line graph to be Hamiltonian are obtain