3-regular graphs are 2-reconstructible

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

doi:10.1016/j.ejc.2020.103216

3-regular graphs are 2-reconstructible

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

Mathematics

Research output: Contribution to journal › Article › peer-review

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
Volume	91
DOIs	https://doi.org/10.1016/j.ejc.2020.103216
State	Published - Jan 2021

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics

Online availability

10.1016/j.ejc.2020.103216

Library availability

Discover UIUC Full Text

Cite this

@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 = "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",

}

TY - JOUR

T1 - 3-regular graphs are 2-reconstructible

AU - Kostochka, Alexandr V.

AU - Nahvi, Mina

AU - West, Douglas B.

AU - Zirlin, Dara

PY - 2021/1

Y1 - 2021/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85091614827&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85091614827&partnerID=8YFLogxK

U2 - 10.1016/j.ejc.2020.103216

DO - 10.1016/j.ejc.2020.103216

M3 - Article

AN - SCOPUS:85091614827

SN - 0195-6698

VL - 91

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

M1 - 103216

ER -

3-regular graphs are 2-reconstructible

Abstract

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this