The reconstruction of a tree from its number deck

DOI10.1016/0012-365X(85)90136-0zbMath0565.05021OpenAlexW2075019347MaRDI QIDQ1058517

J. Schönheim, Ilia Krasikov

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0012-365x(85)90136-0

zbMATH Keywords

treereconstructibilitynumber deck

Mathematics Subject Classification ID

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

Related Items (3)

Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves ⋮ Interchanging branches and similarity in a tree ⋮ Automorphisms of Kronrod-Reeb graphs of Morse functions on compact surfaces

Cites Work

• A congruence theorem for trees
• The Reconstruction of a Tree from its Maximal Subtrees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The reconstruction of a tree from its number deck