✦ LIBER ✦

Toughness, hamiltonicity and split graphs

✍ Scribed by Dieter Kratsch; Jenő Lehel; Haiko Müller

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 728 KB
Volume: 150
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00190-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Toughness and hamiltonicity in almost cl

Toughness and hamiltonicity in almost claw-free graphs

✍ Broersma, H.J.; Ryj�?ek, Z.; Schiermeyer, I. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 3 views

Some known results on claw-free (Kl,3-free) graphs are generalized to the larger class of almost claw-free graphs which were introduced by RyjaEek. In particular, w e show that a 2-connected almost claw-free graph is I-tough, and that a 2-connected almost claw-free graph on n vertices is hamiltonian

On the Edge Connectivity, Hamiltonicity,

On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs

✍ Jan van den Heuvel; Bill Jackson 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Let G be a connected k-regular vertex-transitive graph on n vertices. For S V(G) let d(S) denote the number of edges between S and V(G)"S. We extend results of Mader and Tindell by showing that if d(S)< 2 9 (k+1) 2 for some S V(G) with 1 3 (k+1) |S| 1 2 n, then G has a factor F such that GÂE(F ) is

Powers of connected graphs and hamiltoni

Powers of connected graphs and hamiltonicity

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

Neighborhood unions and hamiltonicity of

Neighborhood unions and hamiltonicity of graphs

✍ Ruqun Shen; Feng Tian 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 530 KB

Let G be a graph of order n. In this paper, we prove that if G is a 2-connected graph of order n such that for all u, ve V(G), 2 where dist(u,v) is the distance between u and v in G, then either G is hamiltonian, or G is a spanning subgraph of a graph in one of three families of exceptional graphs.

Mengerian properties, hamiltonicity, and

Mengerian properties, hamiltonicity, and claw-free graphs

✍ E. Flandrin; H. Li 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 603 KB

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