Journal of Combinatorial Theory, Series BVolume 30, Issue 2, April 1981, Pages 188-195The reconstruction of maximal planar graphs. I. RecognitionAuthor links open overlay panelS Fiorini, J LauriShow moreShareCitehttps://doi.org/10.1016/0095-8956(81)90063-0Get rights and contentUnder an Elsevier user licenseopen archiveAbstractThe object of this paper is to show that every maximal planar graph is recognizable from its family of vertex-deleted subgraphs.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1981 Published by Elsevier Inc.
