✦ LIBER ✦

Hamiltonicity of 4-connected graphs

✍ Scribed by Hao Li; Feng Tian; Zhi Xia Xu

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2010
Tongue: English
Weight: 230 KB
Volume: 26
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-010-7514-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonicity and forbidden subgraphs in

Hamiltonicity and forbidden subgraphs in 4-connected graphs

✍ Florian Pfender 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB

## Abstract Let __T__ be the line graph of the unique tree __F__ on 8 vertices with degree sequence (3,3,3,1,1,1,1,1), i.e., __T__ is a chain of three triangles. We show that every 4‐connected {__T__, __K__~1,3~}‐free graph has a hamiltonian cycle. © 2005 Wiley Periodicals, Inc. J Graph Theory 49:

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

Powers of connected graphs and hamiltoni

Powers of connected graphs and hamiltonicity

✍ M. Paoli 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 783 KB

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

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