✦ LIBER ✦

MINIMALLY 2-EDGE-CONNECTED GRAPHS

✍ Scribed by Stephen B. Maurer; Peter J. Slater

Book ID: 118717675
Publisher: John Wiley and Sons
Year: 1979
Tongue: English
Weight: 309 KB
Volume: 319
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1979.tb32812.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

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 (k, k)-edge-connected graphs

✍ Kamal Hennayake; Hong-Jian Lai; Deying Li; Jingzhong Mao 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 1 views

## Abstract For an integer __l__ > 1, the __l__‐edge‐connectivity of a connected graph with at least __l__ vertices is the smallest number of edges whose removal results in a graph with __l__ components. A connected graph __G__ is (__k__, __l__)‐edge‐connected if the __l__‐edge‐connectivity of __G_

On k-minimally n-edge-connected graphs

✍ Stephen B. Maurer; Peter J. Slater 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 815 KB

Edge-reconstruction of minimally 3-conne

Edge-reconstruction of minimally 3-connected planar graphs

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