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.
| Original language | English (US) |
|---|---|
| Article number | 103216 |
| Journal | European Journal of Combinatorics |
| DOIs | |
| State | Accepted/In press - 2020 |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
Fingerprint Dive into the research topics of '3-regular graphs are 2-reconstructible'. Together they form a unique fingerprint.
Cite this
Kostochka, A. V., Nahvi, M., West, D. B., & Zirlin, D. (Accepted/In press). 3-regular graphs are 2-reconstructible. European Journal of Combinatorics, [103216]. https://doi.org/10.1016/j.ejc.2020.103216