The following pages link to Reconstruction of Trees (Q5597454):
Displayed 20 items.
- Proof of Harary's conjecture on the reconstruction of trees (Q1169484) (← links)
- On reconstructing graphs from their sets of subgraphs (Q1229231) (← links)
- Reconstructing trees from two point deleted subtrees (Q1229731) (← links)
- Edge-recognizable domination numbers. (Q1415542) (← links)
- On reconstructing maximal outerplanar graphs (Q1843446) (← links)
- Reconstruction of a tree from its homomorphic images and other related transforms (Q1845887) (← links)
- The reconstruction of outerplanar graphs (Q2264676) (← links)
- Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves (Q2412994) (← links)
- Reconstruction of maximal outerplanar graphs (Q2552507) (← links)
- Reconstructing the degree pair sequence of a digraph (Q2555081) (← links)
- Bemerkungen zur Ulam-Vermutung (Q2555086) (← links)
- Set recognition of decomposable graphs and steps towards their reconstruction (Q2673544) (← links)
- ON α,β DESTRUCTIBLE GRAPHS (Q3333080) (← links)
- On the reconstruction of rayless infinite forests (Q3338287) (← links)
- Reconstruction of a Pair of Graphs from their Concatenations (Q3964610) (← links)
- Graph reconstruction—a survey (Q4154892) (← links)
- Nearly acyclic graphs are reconstructible (Q4159408) (← links)
- A survey on edge reconstruction of graphs (Q4792930) (← links)
- Reconstructing trees from two cards (Q5189235) (← links)
- Realization problems on reachability sequences (Q5925515) (← links)