published by Dara Zirlin
in 2019
and research's language is
English
Download
Abstract in English
A graph is $ell$-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $ell$ vertices. We prove that $3$-regular graphs are $2$-reconstructible.