3-regular graphs are 2-reconstructible

Alexandr V. Kostochka, Mina Nahvi, Douglas B. West, Dara Zirlin

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Article number103216
JournalEuropean Journal of Combinatorics
StatePublished - Jan 2021

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics


Dive into the research topics of '3-regular graphs are 2-reconstructible'. Together they form a unique fingerprint.

Cite this