Reconstructing trees from two cards

DOI10.1002/JGT.20424MaRDI QIDQ5189235zbMATH OpenOpenAlexFDO

Authors 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 theoryreconstructiontrees

Mathematics Subject Classification ID

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

Recommendations

• ON THE CLASS-RECONSTRUCTION NUMBER OF TREES
• The reconstruction of a tree from its number deck
• scientific article; zbMATH DE number 20509
• Publication:4887809
• scientific article; zbMATH DE number 434894

Cites work

• A congruence theorem for trees
• Graph reconstruction—a survey
• scientific article; zbMATH DE number 3272216 (Why is no real title available?)
• Interchanging branches and similarity in a tree
• On pseudosimilarity in trees
• ON THE CLASS-RECONSTRUCTION NUMBER OF TREES
• Proof of Harary's conjecture on the reconstruction of trees
• Reconstruction of Trees
• The ally-reconstruction number of a tree with five or more vertices is three
• The Reconstruction of a Tree from its Maximal Subtrees

Cited in

(10)

• The reconstruction of a tree from its number deck
• Interchanging branches and similarity in a tree
• 3-reconstructibility of rooted trees
• scientific article; zbMATH DE number 434894 (Why is no real title available?)
• ON THE CLASS-RECONSTRUCTION NUMBER OF TREES
• scientific article; zbMATH DE number 492708 (Why is no real title available?)
• scientific article; zbMATH DE number 913538 (Why is no real title available?)
• Decks of rooted binary trees
• The degree-associated reconstruction number of an unicentroidal tree
• Degree-associated reconstruction number of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189235)