✦ LIBER ✦

Hamiltonicity of a type of interchange graphs

✍ Scribed by Xueliang Li; Fuji Zhang

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 338 KB
Volume: 51
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90099-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonicity of tree-like graphs

✍ Dragan Marušič 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 426 KB

We investigate hamiltonian properties of a class of graphs whose "factor graphs" are trees. Some results for regular and vertex-transitive graphs are also proved.

Hamiltonicity of 4-connected graphs

✍ Hao Li; Feng Tian; Zhi Xia Xu 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 230 KB

The interchange graph of a finite graph

✍ A. C. M. van Rooij; H. S. Wilf 📂 Article 📅 1965 🏛 Akadmiai Kiad 🌐 English ⚖ 284 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

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.