✦ LIBER ✦

Hamiltonicity of 2-connected claw-center independent graphs

✍ Scribed by Hao Li; Mei Lu; Feng Tian; Bing Wei

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 679 KB
Volume: 165-166
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00192-6

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

Hamiltonicity in 2-connected graphs with

Hamiltonicity in 2-connected graphs with claws

✍ Hao Li; Mei Lu; Zhiren Sun 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 562 KB

Matthews and Sumner have proved in [12] that if G is a 2-connected claw-free graph of order n such that 6>~(n-2)/3, then G is hamiltonian. Li has shown that the bound for the minimum degree 6 can be reduced to n/4 under the additional condition that G is not in /7, where /7 is a class of graphs defi

Hamiltonicity of regular 2-connected gra

Hamiltonicity of regular 2-connected graphs

✍ Broersma, H. J.; van den Heuvel, J.; Jackson, B.; Veldman, H. J. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 832 KB

Let G be a k-regular 2-connected graph of order n. Jackson proved that G is hamiltonian if n 5 3k. Zhu and Li showed that the upper bound 3k on n can be relaxed to q k if G is 3-connected and k 2 63. We improve both results by showing that G is hamiltonian if n 5 gk -7 and G does not belong to a res

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

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

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