Summary
It is shown that minimally 3-connected planar graphs are edge-reconstructible.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bondy, J. A. andHemminger, R. L.,Graph reconstruction—a survey. J. Graph Theory1 (1977), 227–268.
Bondy, J. A.,A graph reconstructor's manual, Surveys in Combinatorics, 1991. [LMS Lecture Notes, No. 166]. Cambridge University Press, 1991.
Fiorini, S.,On the edge-reconstruction of planar graphs. Math. Proc. Cambridge Philos. Soc.83 (1978), 31–35.
Halin, R.,On the structure of n-connected graphs. In Recent Progress in Combinatorics. Academic Press, New York, 1968, pp. 91–102.
Harary, F.,On the reconstruction of a graph from a collection of subgraphs. In Theory of Graphs and its Applications (Proceedings of the Symposium held in Prague, 1964), ed. M. Fiedler. Czechoslovak Academy of Sciences, Prague, reprinted by Academic Press, New York, 1964, pp. 47–52.
Ore, O.,The Four-Color Problem. Academic Press, New York, 1967.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhao, Y. Edge-reconstruction of minimally 3-connected planar graphs. Aeq. Math. 47, 1–10 (1994). https://doi.org/10.1007/BF01838135
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01838135