Reconstruction of locally finite connected graphs with at least three infinite wings
C. St. J. A. Nash‐Williams · Journal of Graph Theory · 1987
Abstract Let G be a locally finite connected graph that can be expressed as the union of a finite subgraph and p disjoint infinite subgraphs, where 3 ≦ p < ∞, but cannot be expressed as the union of a finite subgraph and p + 1 disjoint infinite subgraphs. Then G is reconstructible.