𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs

✍ Scribed by Jun Fujisawa

Book ID
112121126
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
572 KB
Volume
73
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Hamiltonicity and Minimum Degree in 3-co
Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs
✍ Odile Favaron; Pierre Fraisse πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 112 KB

Using Ryja c ek's closure, we prove that any 3-connected claw-free graph of order & and minimum degree $ &+38 10 is hamiltonian. This improves a theorem of Kuipers and Veldman who got the same result with the stronger hypotheses $ &+29 8 and & sufficiently large and nearly proves their conjecture sa

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

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.