✦ LIBER ✦

Edge-reconstruction of minimally 3-connected planar graphs

✍ Scribed by Yue Zhao

Publisher: Springer
Year: 1994
Tongue: English
Weight: 437 KB
Volume: 47
Category: Article
ISSN: 0001-9054
DOI: 10.1007/bf01838135

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-reconstruction of 4-connected plana

Edge-reconstruction of 4-connected planar graphs

✍ S. Fiorini; J. Lauri 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB 👁 2 views

## Abstract The object of this paper is to show that 4‐connected planar graphs are uniquely determined from their collection of edge‐deleted subgraphs.

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 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 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 (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 the edge-reconstruction of 3-connecte

On the edge-reconstruction of 3-connected planar graphs with minimum valency 4

✍ Yue Zhao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 550 KB

It is shown that a 3-connected planar graph with minimum valency 4 is edge-reconstructible if no 4-vertex is adjacent to a 5-vertex. ## 1. Introduction In this paper, all graphs G=(V(G),E(G)) considered will be finite and simple. A connected graph G is said to have connectivity k o = ko(G) if the