Reconstructing trees from two cards

DOI10.1002/jgt.20424zbMath1201.05065OpenAlexW4249743500MaRDI QIDQ5189235

Manuel Welhan

Publication date: 15 March 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20424

zbMATH Keywords

graph theorytreesreconstruction

Mathematics Subject Classification ID

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

Related Items (1)

Degree-associated reconstruction number of graphs

Cites Work

• Unnamed Item
• A congruence theorem for trees
• On pseudosimilarity in trees
• Proof of Harary's conjecture on the reconstruction of trees
• Interchanging branches and similarity in a tree
• The ally-reconstruction number of a tree with five or more vertices is three
• ON THE CLASS-RECONSTRUCTION NUMBER OF TREES
• Graph reconstruction—a survey
• The Reconstruction of a Tree from its Maximal Subtrees
• Reconstruction of Trees

This page was built for publication: Reconstructing trees from two cards