Abstract
In this paper we enhance the PLA relational spatial model for storing a special type of planar graphs. The PLA-model is very handy to store 2-connected planar graphs, but it is not capable at all to store some other important classes of planar graphs: trees and, more generally, planar graphs with cut edges. In this paper we propose a method for their representation. The main idea is based on Halin graphs that are planar graphs of minimum degree 3 from which the removal of the boundary edges of the infinite region yields a tree. Our results are to identify Halin graphs from the model, and to represent trees as virtual Halin graphs in order to store them without major alteration of the original PLA-Model.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
