✦ LIBER ✦

Panconnectivity of locally connected claw-free graphs

✍ Scribed by Yu Sheng; Feng Tian; Bing Wei

Book ID: 108316336
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 91 KB
Volume: 203
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00010-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Connected, locally 2-connected, K1,3-fre

Connected, locally 2-connected, K1,3-free graphs are panconnected

✍ S. V. Kanetkar; P. R. Rao 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 1 views

## Abstract A graph __G__ is locally __n__‐connected, __n__ ≥ 1, if the subgraph induced by the neighborhood of each vertex is __n__‐connected. We prove that every connected, locally 2‐connected graph containing no induced subgraph isomorphic to __K__~1,3~ is panconnected.

Hamiltonian Connected Claw-Free Graphs

✍ MingChu Li 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 395 KB

Quadrangularly connected claw-free graph

Quadrangularly connected claw-free graphs

✍ MingChu Li; Cheng Guo; Liming Xiong; Dengxin Li; Hong-Jian Lai 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 187 KB

Sufficient condition for Hamiltonicity o

Sufficient condition for Hamiltonicity of N2-locally connected claw-free graphs

✍ Halina Bielak 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 89 KB

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.