Reconstruction of maximal outerplanar graphs
From MaRDI portal
Publication:2552507
DOI10.1016/0012-365X(72)90007-6zbMath0237.05103MaRDI QIDQ2552507
Publication date: 1972
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
On the complexity of graph reconstruction, The reconstruction of outerplanar graphs, On reconstructing graphs from their sets of subgraphs, Sharp bounds for Zagreb indices of maximal outerplanar graphs, Point deletions of outerplanar blocks, On reconstructing maximal outerplanar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A congruence theorem for trees
- On the problem of reconstructing a tournament from subtournaments
- On Ulam's conjecture for separable graphs
- The Reconstruction of a Tree from its Maximal Subtrees
- On Reconstructing a Graph
- On reconstruction of graphs
- Reconstruction of Cacti
- Reconstruction of Trees