3-Regular Graphs Are 2-Reconstructible


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.

Download