๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On hamiltonicity of 2-connected claw-free graphs

โœ Scribed by Run-li Tian, Li-ming Xiong

Book ID
113089978
Publisher
SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year
2012
Tongue
English
Weight
214 KB
Volume
27
Category
Article
ISSN
1005-1031

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Hamiltonicity of 2-connected claw-center
Hamiltonicity of 2-connected claw-center independent graphs
โœ Hao Li; Mei Lu; Feng Tian; Bing Wei ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 679 KB

In this paper, we give the following result: Let G be a 2-connected graph of order PZ> 13 and nd2az -3, where 02 = min{d(u) + d(u): uz'.$E(G)}. If the set of claw-centers of G is independent, then either G is hamiltonian or G belongs to three classes of exceptional graphs. The bound n <202 -3 is sha

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

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