The reconstruction of outerplanar graphs

DOI10.1016/0095-8956(74)90066-5zbMath0274.05102OpenAlexW1982410959MaRDI QIDQ2264676

William B. Giles

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(74)90066-5

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)

Related Items (10)

Reconstruction of a Pair of Graphs from their Concatenations ⋮ BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE ⋮ On the complexity of graph reconstruction ⋮ Reconstructing the degree sequence of a sparse graph from a partial deck ⋮ Reconstructing trees from two point deleted subtrees ⋮ Point deletions of outerplanar blocks ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ A reduction of the graph reconstruction conjecture ⋮ Reconstructing Cactus Graphs from Shortest Path Information ⋮ Reconstruction of a tree from its homomorphic images and other related transforms

Cites Work

• A congruence theorem for trees
• Point deletions of outerplanar blocks
• On Ulam's conjecture for separable graphs
• Reconstruction of maximal outerplanar graphs
• The Reconstruction of a Tree from its Maximal Subtrees
• Reconstruction of Cacti
• Reconstruction of Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The reconstruction of outerplanar graphs