نشر في Dara Zirlin
بتاريخ 2019
والبحث باللغة
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.