3-regular graphs are 2-reconstructible
Autor: | Dara Zirlin, Mina Nahvi, Alexandr V. Kostochka, Douglas B. West |
---|---|
Rok vydání: | 2021 |
Předmět: | |
Zdroj: | European Journal of Combinatorics. 91:103216 |
ISSN: | 0195-6698 |
Popis: | A graph is l -reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting l vertices. We prove that 3-regular graphs are 2-reconstructible. |
Databáze: | OpenAIRE |
Externí odkaz: |