Reconstruction number of graphs with unique pendant vertex
From MaRDI portal
Publication:2235292
DOI10.1016/j.dam.2020.06.005zbMath1482.05237OpenAlexW3034447934MaRDI QIDQ2235292
Publication date: 21 October 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.06.005
Cites Work
- Reconstruction of distance hereditary 2-connected graphs
- Almost every graph has reconstruction number three
- The reconstruction conjecture is true if all 2-connected graphs are reconstructible
- The graph reconstruction number
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Reconstruction number of graphs with unique pendant vertex