3-regular graphs are 2-reconstructible
From MaRDI portal
Publication:2225421
DOI10.1016/j.ejc.2020.103216zbMath1458.05172arXiv1908.01258OpenAlexW3087995110MaRDI QIDQ2225421
Mina Nahvi, Douglas B. West, Dara Zirlin, Alexandr V. Kostochka
Publication date: 8 February 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.01258
Related Items
Cites Work
- A congruence theorem for trees
- Reconstructing degree sequences from k-vertex-deleted subgraphs
- Finite undirected graphs which are not reconstructible from their large cardinality subgraphs
- Some basic observations on Kelly's conjecture for graphs
- Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices
- Almost every graph has reconstruction number three
- Reconstruction from the deck of ‐vertex induced subgraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item