✦ LIBER ✦

Hamilton-connected indices of graphs

✍ Scribed by Zhi-Hong Chen; Hong-Jian Lai; Liming Xiong; Huiya Yan; Mingquan Zhan

Book ID: 108114059
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 837 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.06.030

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Hamiltonicity of 4-connected graphs

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

Forwarding indices of k-connected graphs

✍ M.C Heydemann; J.C Meyer; J Opatrny; D Sotteau 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 935 KB

Powers of connected graphs and hamiltoni

Powers of connected graphs and hamiltonicity

✍ M. Paoli 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 783 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

Hamiltonicity of 3-connected line graphs

✍ Weihua Yang; Liming Xiong; Hongjian Lai; Xiaofeng Guo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 199 KB