Abstract
A theorem due to Wagner states that given two maximal planar graphs with n vertices, one can be obtained from the other by performing a finite sequence of diagonal flips. In this paper, we show a result of a similar flavour—given two maximal planar graphs of inscribable type having the same vertex set, one can be obtained from the other by performing a finite sequence of diagonal flips such that all the intermediate graphs are of inscribable type.
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.
