𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Every 3-connected distance claw-free graph is Hamilton-connected

✍ Scribed by Rao Li; R.H. Schelp

Book ID
108315838
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
147 KB
Volume
268
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 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

9-Connected Claw-Free Graphs Are Hamilto
9-Connected Claw-Free Graphs Are Hamilton-Connected
✍ Stephan Brandt πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 130 KB

A graph is Hamilton-connected if any pair of vertices is joined by a hamiltonian path. In this note it is shown that 9-connected graphs which contain no induced claw K 1, 3 are Hamilton-connected, by reformulating and localizing a closure concept due to Ryja c ek, which turns claw-free graphs into l

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

Hamilton connectivity of line graphs and
Hamilton connectivity of line graphs and claw-free graphs
✍ Zhiquan Hu; Feng Tian; Bing Wei πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 117 KB

## Abstract Let __G__ be a graph and let __V__~0~ = {ν∈ __V__(__G__): __d__~__G__~(Ξ½) = 6}. We show in this paper that: (i) if __G__ is a 6‐connected line graph and if |__V__~0~| ≀ 29 or __G__[__V__~0~] contains at most 5 vertex disjoint __K__~4~'s, then __G__ is Hamilton‐connected; (ii) every 8‐co