Reconstruction of maximal outerplanar graphs

DOI10.1016/0012-365X(72)90007-6MaRDI QIDQ2552507zbMATH OpenFDO

Authors Bennet Manvel

Publication date 1972

Published in Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites work

• 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 3299378 (Why is no real title available?)
• scientific article; zbMATH DE number 3317675 (Why is no real title available?)
• A congruence theorem for trees
• On Reconstructing a Graph
• On Ulam's conjecture for separable graphs
• On reconstruction of graphs
• On the problem of reconstructing a tournament from subtournaments
• Reconstruction of Cacti
• Reconstruction of Trees
• The Reconstruction of a Tree from its Maximal Subtrees

Cited in

(6)

• Sharp bounds for Zagreb indices of maximal outerplanar graphs
• On the complexity of graph reconstruction
• On reconstructing graphs from their sets of subgraphs
• Point deletions of outerplanar blocks
• On reconstructing maximal outerplanar graphs
• The reconstruction of outerplanar graphs

This page was built for publication: Reconstruction of maximal outerplanar graphs

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