scientific article; zbMATH DE number 7370933

zbMath1468.05134MaRDI QIDQ5000297

S. Monikandan, P. Devi Priya

Publication date: 12 July 2021

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/80/ajc_v80_p167.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

parity graphsreconstructible graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40)

Related Items (2)

Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs ⋮ Reconstruction and edge reconstruction of triangle-free graphs

Cites Work

• Some work towards the proof of the reconstruction conjecture
• Reconstruction of distance hereditary 2-connected graphs
• A reduction of the graph reconstruction conjecture
• The reconstruction conjecture is true if all 2-connected graphs are reconstructible
• The falsity of the reconstruction conjecture for tournaments
• Graph reconstruction—a survey
• 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: