The Reconstruction of a Tree from its Maximal Subtrees
From MaRDI portal
Publication:5516077
DOI10.4153/CJM-1966-079-8zbMath0141.21402OpenAlexW2317491378MaRDI QIDQ5516077
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
Related Items
Reconstruction of a Pair of Graphs from their Concatenations, Complexity results in graph reconstruction, Maximal proper subgraphs of median graphs, Leaf-Reconstructibility of Phylogenetic Networks, On Reconstructing a Graph, Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves, Proof of Harary's conjecture on the reconstruction of trees, On distinguishing trees by their chromatic symmetric functions, ON α,β DESTRUCTIBLE GRAPHS, A chromatic symmetric function in noncommuting variables, The reconstruction of outerplanar graphs, Reconstructing trees from two cards, Reconstructing trees from two point deleted subtrees, Graph reconstruction—a survey, Bemerkungen zu einem Isomorphie-Problem für Graphen, die speziellen Matrizen zugeordnet sind, Reconstruction of maximal outerplanar graphs, Reconstructing the degree pair sequence of a digraph, The reconstruction of a tree from its number deck
