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

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

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

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 - https://www.scopus.com/pages/publications/85091614827

UR - https://www.scopus.com/pages/publications/85091614827#tab=citedBy

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