Nearly acyclic graphs are reconstructible
Bennet Manvel, Joseph M. Weinstein · Journal of Graph Theory · 1978
Abstract We prove that a graph G is reconstructible if G has a node v with G‐v acyclic. The proof uses colored graphs and shows how to reconstruct some graphs from pieces which share a common subgraph having few automorphisms.