@article{85bde2b29c1a4bdab9a2558988290382,
title = "3-regular graphs are 2-reconstructible",
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.",
author = "Kostochka, {Alexandr V.} and Mina Nahvi and West, {Douglas B.} and Dara Zirlin",
note = "Funding Information: Research supported in part by NSF grant DMS-1600592 and grants 18-01-00353A and 19-01-00682 of the Russian Foundation for Basic Research.Supported by National Natural Science Foundation of China grant NSFC 11871439 and 11971439.Research supported in part by Arnold O. Beckman Campus Research Board AwardRB20003 of the University of Illinois at Urbana-Champaign. Publisher Copyright: {\textcopyright} 2020 Elsevier Ltd",
year = "2021",
month = jan,
doi = "10.1016/j.ejc.2020.103216",
language = "English (US)",
volume = "91",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",
}