Some work towards the proof of the reconstruction conjecture

DOI10.1016/S0012-365X(03)00198-5zbMath1028.05070OpenAlexW2079732894WikidataQ122979015 ScholiaQ122979015MaRDI QIDQ1412674

D. Massart

Publication date: 25 November 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00198-5

zbMATH Keywords

DiameterReconstruction conjecture

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

Reconstruction of distance hereditary 2-connected graphs ⋮ Unnamed Item ⋮ Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs ⋮ Reconstruction and edge reconstruction of triangle-free graphs ⋮ Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible ⋮ A reduction of the graph reconstruction conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• A congruence theorem for trees
• Graph reconstruction—a survey

This page was built for publication: Some work towards the proof of the reconstruction conjecture