The Reconstruction of a Tree from its Maximal Subtrees

DOI10.4153/CJM-1966-079-8MaRDI QIDQ5516077zbMATH OpenOpenAlexFDO

Authors Frank Harary, Edgar M. Palmer

Publication date 1966

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/cjm-1966-079-8

Mathematics Subject Classification ID

Trees (05C05)

Cited in

(21)

• The reconstruction of a tree from its number deck
• Proof of Harary's conjecture on the reconstruction of trees
• Reconstructing trees from two point deleted subtrees
• The reconstruction of outerplanar graphs
• Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves
• On distinguishing trees by their chromatic symmetric functions
• Reconstruction of maximal outerplanar graphs
• Reconstructing the degree pair sequence of a digraph
• ON α,β DESTRUCTIBLE GRAPHS
• Bemerkungen zu einem Isomorphie-Problem für Graphen, die speziellen Matrizen zugeordnet sind
• Reconstruction of a Pair of Graphs from their Concatenations
• Graph reconstruction—a survey
• Leaf-reconstructibility of phylogenetic networks
• Reconstructing trees from two cards
• On Reconstructing a Graph
• A chromatic symmetric function in noncommuting variables
• Polynomial invariants for rooted trees related to their random destruction
• Classification of trees whose maximal subtrees are all isomorphic
• Reconstruction from smaller cards
• Complexity results in graph reconstruction
• Maximal proper subgraphs of median graphs

This page was built for publication: The Reconstruction of a Tree from its Maximal Subtrees

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