✦ LIBER ✦

Meshes on 3-connected graphs

✍ Scribed by Gert Sabidussi

Book ID: 107748110
Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 866 KB
Volume: 1
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(71)90015-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On 3-connected minors of 3-connected mat

On 3-connected minors of 3-connected matroids and graphs

✍ João Paulo Costalonga 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 265 KB

On 3-connected hamiltonian line graphs

✍ Ye Chen; Suohai Fan; Hong-Jian Lai 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 223 KB

On Cycles in 3-Connected Graphs

✍ Hao Li 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 156 KB

On 3-Edge-Connected Supereulerian Graphs

✍ Hong-Jian Lai; Hao Li; Yehong Shao; Mingquan Zhan 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 222 KB

Minimally 3-connected graphs

✍ Robin W Dawes 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 489 KB

Extremal 3-connected graphs

✍ Stephen C. Locke 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 686 KB

Let G be a 3-connected graph with minimum degree at least d and at least 2d vertices. For any three distinct vertices X, y, z there is a path from x to z through y and having length at least M -2. In this paper, we characterize those graphs for which no such path has length exceeding 2d -2. ## I.