Reconstruction and edge reconstruction of triangle-free graphs
From MaRDI portal
Publication:6184530
DOI10.1016/j.disc.2023.113753arXiv2210.00338MaRDI QIDQ6184530
Abhinav Shantanam, Alexander Clifton, Reem Mahmoud, Xiaonan Liu
Publication date: 25 January 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.00338
Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- A congruence theorem for trees
- Some work towards the proof of the reconstruction conjecture
- The reconstruction conjecture is true if all 2-connected graphs are reconstructible
- Graph reconstruction—a survey
- Reconstructing Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Reconstruction and edge reconstruction of triangle-free graphs