3-regular graphs are 2-reconstructible. (January 2021) - Kostochka, Alexandr V.
Abstract: A graph is ℓ -reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting ℓ vertices. We prove that 3-regular graphs are 2-reconstructible.