𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonicity of tree-like graphs

✍ Scribed by Dragan Marušič

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
426 KB
Volume
80
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Hamiltonicity of 4-connected graphs
Hamiltonicity of 4-connected graphs
✍ Hao Li; Feng Tian; Zhi Xia Xu 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 230 KB
Hamiltonicity in balancedk-partite graph
Hamiltonicity in balancedk-partite graphs
✍ Guantao Chen; Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesn 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 538 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

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.