✦ LIBER ✦

A construction of 3-connected graphs

✍ Scribed by D. W. Barnette

Book ID: 112889480
Publisher: The Hebrew University Magnes Press
Year: 1994
Tongue: English
Weight: 495 KB
Volume: 86
Category: Article
ISSN: 0021-2172
DOI: 10.1007/bf02773688

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Cyclability of 3-connected graphs

✍ Amel Harkat-Benhamdine; Hao Li; Feng Tian 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 1 views

Connected Spanning Subgraphs of 3-Connec

Connected Spanning Subgraphs of 3-Connected Planar Graphs

✍ Hikoe Enomoto; Tadashi Iida; Katsuhiro Ota 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 339 KB

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

Removable edges in a 5-connected graph a

Removable edges in a 5-connected graph and a construction method of 5-connected graphs

✍ Liqiong Xu; Xiaofeng Guo 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 152 KB