✦ LIBER ✦

The asymptotic connectivity of labelled regular graphs

✍ Scribed by Nicholas C. Wormald

Book ID: 108395451
Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 492 KB
Volume: 31
Category: Article
ISSN: 0095-8956
DOI: 10.1016/s0095-8956(81)80021-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Asymptotic connectivity of infinite grap

Asymptotic connectivity of infinite graphs

✍ Patrick Bahls 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 608 KB

Long path connectivity of regular graphs

✍ Cun-Quan Zhang; Yong-Jin Zhu 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 842 KB

Zhang, C.-Q. and Y.-J. Zhu, Long path connectivity of regular graphs, Discrete Mathematics 96 (1991) 151-160. Any pair of vertices in a 4-connected path or a path of length at least 3k-6. non-bipartite k-regular graph are joined bY a Hamilton \* This research was partially supported by AFOSR under g

Asymptotic connectivity of hyperbolic pl

Asymptotic connectivity of hyperbolic planar graphs

✍ Patrick Bahls; Michael R. Dipasquale 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 261 KB

Super Restricted Edge Connectivity of Re

Super Restricted Edge Connectivity of Regular Graphs

✍ Ou Jianping; Fuji Zhang 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 244 KB

Eigenvalues and edge-connectivity of reg

Eigenvalues and edge-connectivity of regular graphs

✍ Sebastian M. Cioabă 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 203 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