Reconstruction of Trees
From MaRDI portal
Publication:5597454
DOI10.4153/CJM-1970-007-4zbMath0199.27404MaRDI QIDQ5597454
Publication date: 1970
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Related Items
Reconstruction of a Pair of Graphs from their Concatenations, A survey on edge reconstruction of graphs, Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves, Set recognition of decomposable graphs and steps towards their reconstruction, Edge-recognizable domination numbers., Proof of Harary's conjecture on the reconstruction of trees, ON α,β DESTRUCTIBLE GRAPHS, The reconstruction of outerplanar graphs, On the reconstruction of rayless infinite forests, On reconstructing graphs from their sets of subgraphs, Reconstructing trees from two cards, Reconstructing trees from two point deleted subtrees, Graph reconstruction—a survey, Nearly acyclic graphs are reconstructible, Realization problems on reachability sequences, Reconstruction of maximal outerplanar graphs, Reconstructing the degree pair sequence of a digraph, Bemerkungen zur Ulam-Vermutung, On reconstructing maximal outerplanar graphs, Reconstruction of a tree from its homomorphic images and other related transforms
