𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Halina Bielak

Book ID
108316388
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
89 KB
Volume
213
Category
Article
ISSN
0012-365X

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

Maximal K3's and Hamiltonicity of 4-conn
Maximal K3's and Hamiltonicity of 4-connected claw-free graphs
✍ Jun Fujisawa; Katsuhiro Ota πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 255 KB πŸ‘ 1 views

## Abstract Let __cl__(__G__) denote RyjÑček's closure of a claw‐free graph __G__. In this article, we prove the following result. Let __G__ be a 4‐connected claw‐free graph. Assume that __G__[__N__~__G__~(__T__)] is cyclically 3‐connected if __T__ is a maximal __K__~3~ in __G__ which is also maxim

A necessary and sufficient condition for
A necessary and sufficient condition for connected, locally k-connected k1,3-free graphs to be k-hamiltonian
✍ Zhou Huai-Lu πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 272 KB πŸ‘ 2 views

We prove the following conjecture of Broersma and Veldman: A connected, locally k-connected K,,-free graph is k-hamiltonian if and only if it is (k + 2)-connected ( k L 1). We use [ 11 for basic terminology and notation, and consider simple graphs only. Let G be a graph. By V(G) and E(G) we denote,