Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/112084| Title: | The reconstruction of maximal planar graphs I. recognition |
| Authors: | Fiorini, S. Lauri, Josef |
| Keywords: | Graph theory Graphic methods Mathematics -- Charts, diagrams, etc. |
| Issue Date: | 1981 |
| Publisher: | Academic Press |
| Citation: | Fiorini, S., & Lauri, J. (1981). The reconstruction of maximal planar graphs. I. recognition. Journal of Combinatorial Theory, Series B, 30(2), 188-195. |
| Abstract: | The object of this paper is to show that every maximal planar graph is recognizable from its family of vertex-deleted subgraphs. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/112084 |
| Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| The_reconstruction_of_maximal_planar_graphs_I_recognition_1981.pdf Restricted Access | 111.29 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.