Abstract
Those nonseparable graphs whose induced cycles form a (necessarily minimum length) cycle basis are characterized in several ways — each a generalization of outerplanar graphs. For instance, they are the series–parallel graphs that do not contain a subdivision of K 2,3 as an induced subgraph — whereas the outerplanar graphs are known to be the series–parallel graphs that do not contain a subdivision of K 2,3 as a subgraph. The approach uses a certain ‘tree structure’ such that the outerplanar graphs are those for which that tree structure is unique.
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.
