The reconstruction of outerplanar graphs
From MaRDI portal
Publication:2264676
Cites work
- A congruence theorem for trees
- scientific article; zbMATH DE number 3141308 (Why is no real title available?)
- scientific article; zbMATH DE number 3258862 (Why is no real title available?)
- scientific article; zbMATH DE number 3272216 (Why is no real title available?)
- scientific article; zbMATH DE number 3296030 (Why is no real title available?)
- scientific article; zbMATH DE number 3317675 (Why is no real title available?)
- On Ulam's conjecture for separable graphs
- Point deletions of outerplanar blocks
- Reconstruction of Cacti
- Reconstruction of maximal outerplanar graphs
- Reconstruction of Trees
- The Reconstruction of a Tree from its Maximal Subtrees
Cited in
(13)- Reconstructing trees from two point deleted subtrees
- Point deletions of outerplanar blocks
- Reconstruction of a tree from its homomorphic images and other related transforms
- Reconstructing the degree sequence of a sparse graph from a partial deck
- A reduction of the graph reconstruction conjecture
- Reconstructing cactus graphs from shortest path information (extended abstract)
- Bipartite permutation graphs are reconstructible
- Reconstruction of a Pair of Graphs from their Concatenations
- On the complexity of graph reconstruction
- Graph theory (algorithmic, algebraic, and metric problems)
- Reconstructibility of the K_r-count from n - 1 cards
- Recognizing trees from incomplete decks
- Reconstruction from smaller cards
This page was built for publication: The reconstruction of outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2264676)
