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.
@article{arxiv.1908.01258,
title = {3-Regular Graphs Are 2-Reconstructible},
author = {Alexandr V. Kostochka and Mina Nahvi and Douglas B. West and Dara Zirlin},
journal= {arXiv preprint arXiv:1908.01258},
year = {2019}
}