✦ LIBER ✦

Minimally 3-connected graphs

✍ Scribed by Robin W Dawes

Book ID: 107884241
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 489 KB
Volume: 40
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(86)90074-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-reconstruction of minimally 3-conne

Edge-reconstruction of minimally 3-connected planar graphs

✍ Yue Zhao 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 437 KB

On minimally 3-connected graphs on a sur

On minimally 3-connected graphs on a surface

✍ Katsuhiro Ota 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 23 KB

Characterization of minimally -connected

Characterization of minimally -connected graphs

✍ Xiaofeng Gu; Hong-Jian Lai; Senmei Yao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Minimally restricted edge connected grap

Minimally restricted edge connected graphs

✍ Yanmei Hong; Qinghai Liu; Zhao Zhang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 176 KB

For a connected graph G = (V, E), an edge set S ⊂ E is a restricted edge cut if G -S is disconnected and there is no isolated vertex in G -S. The cardinality of a minimum restricted edge cut of G is the restricted edge connectivity of G, denoted by λ (G). , where ξ(G) is the minimum edge degree of

Minimally 4-edge# -connected graphs

✍ Bernard Peroche; Christine Virlouvet 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 650 KB

In this article, we deal with a connectivity problem stated by Maurer and Slater to characterize minimally k-edge'-connected graphs. This problem has been solved for k = 1,2 and 3, and we recall herein the results obtained. Then we give some partial results concerning the case k =4: representation o

Minimally 2-edge connected graphs

✍ G. Chaty; M. Chein 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 338 KB

## Abstract A constructive characterization of minimally 2‐edge connected graphs, similar to those of Dirac for minimally 2‐connected graphs is given.