Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices
From MaRDI portal
Publication:2175784
DOI10.1007/s00373-020-02131-6zbMath1439.05157arXiv1904.11901OpenAlexW3003830831MaRDI QIDQ2175784
Dara Zirlin, Douglas B. West, Mina Nahvi, Alexandr V. Kostochka
Publication date: 30 April 2020
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.11901
Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
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
- Almost every graph has reconstruction number three
- The graph reconstruction number
- Graph reconstruction—a survey
- Reconstruction from the deck of ‐vertex induced subgraphs
- A survey on edge reconstruction of graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item