Abstract
We characterize the tight structure of a vertex-accumulation-free maximal planar graph with no separating triangles. Together with the result of Halin who gave an equivalent form for such graphs, this yields that a tight structure always exists in every 4-connected maximal planar graph with one end.
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 callMore From: Korean Journal of Computational & Applied Mathematics
Disclaimer: 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.
