𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The reconstruction of maximal planar graphs II. Reconstruction

✍ Scribed by J Lauri

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
863 KB
Volume
30
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On reconstructing maximal outerplanar gr
On reconstructing maximal outerplanar graphs
✍ William B. Giles πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 421 KB

Let C; be a graph, u a vertex of G, and G -{u) the subgraph of G obtained from G by removing the vertex u and all arcs incident with u. G-$1 is calted a point~e~eti~n of G. In f 51, Ulam conjectured that if G has at least three vertices, then G can be reconstructed (up to isomorphism) froin the coil

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.

Edge-reconstruction of planar graphs wit
Edge-reconstruction of planar graphs with minimum valency 5
✍ Josef Lauri πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 780 KB

## Abstract The object of this paper is to show tht every planar graph of minimum valency 5 is reconstructible from its family of edge‐deleted subgraphs.