Reconstruction of Trees

DOI10.4153/CJM-1970-007-4MaRDI QIDQ5597454zbMATH OpenFDO

Authors Bennet Manvel

Publication date 1970

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

Full work available at URL https://doi.org/10.4153/CJM-1970-007-4

zbMATH Keywords

topology

Cited in

(22)

• Proof of Harary's conjecture on the reconstruction of trees
• On reconstructing graphs from their sets of subgraphs
• Reconstructing trees from two point deleted subtrees
• Edge-recognizable domination numbers.
• On reconstructing maximal outerplanar graphs
• Reconstruction of a tree from its homomorphic images and other related transforms
• The reconstruction of outerplanar graphs
• Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves
• Reconstruction of maximal outerplanar graphs
• Reconstructing the degree pair sequence of a digraph
• Bemerkungen zur Ulam-Vermutung
• Set recognition of decomposable graphs and steps towards their reconstruction
• ON α,β DESTRUCTIBLE GRAPHS
• On the reconstruction of rayless infinite forests
• Reconstruction of a Pair of Graphs from their Concatenations
• Graph reconstruction—a survey
• Nearly acyclic graphs are reconstructible
• A survey on edge reconstruction of graphs
• Reconstructing trees from two cards
• Realization problems on reachability sequences
• Classification of trees whose maximal subtrees are all isomorphic
• Reconstruction from smaller cards

This page was built for publication: Reconstruction of Trees

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