Proof of Harary's conjecture on the reconstruction of trees

DOI10.1016/0012-365X(83)90023-7zbMath0495.05048WikidataQ123154215 ScholiaQ123154215MaRDI QIDQ1169484

S. Singh

Publication date: 1983

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

zbMATH Keywords

cutvertex-deleted subgraphscutvertices

Mathematics Subject Classification ID

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

Related Items (4)

Complexity results in graph reconstruction ⋮ On the complexity of graph reconstruction ⋮ Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves ⋮ Reconstructing trees from two cards

Cites Work

• Unnamed Item
• Unnamed Item
• A congruence theorem for trees
• The reconstruction of maximal planar graphs. II: Reconstruction
• Parallel concepts in graph theory
• On Ulam's conjecture for separable graphs
• Graph reconstruction—a survey
• The Reconstruction of a Tree from its Maximal Subtrees
• Reconstruction of Trees
• Trees with Hamiltonian square

This page was built for publication: Proof of Harary's conjecture on the reconstruction of trees