𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reconstructing the n-connected components of a graph

✍ Scribed by D. L. Greenwell; R. L. Hemminger

Publisher
Springer
Year
1973
Tongue
English
Weight
158 KB
Volume
9
Category
Article
ISSN
0001-9054

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Reconstructing the degree sequence and t
Reconstructing the degree sequence and the number of components of an infinite graph
✍ Thomas Andreae πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 812 KB

We prove that the degree sequence of an infinite graph is reconstructibjle from its family of vertex-deleted subgraphs. Furthermore, as another result concerning the reconstruction of infinite graphs, we prove that the number c(G) of components of an infinite graph G is re~ons~uct~b~e if there is at

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.