On Large Induced Outerplanar Subgraphs in 2-Outerplanar Graphs
Abstract Borradaile, Le and Sherman-Bennett [ Graphs and Combinatorics , 2017] proved that every n -vertex 2-outerplane graph has a set of at least 2 n /3 vertices that induces an outerplane graph. We identify a major flaw in their proof and recover their result with a different, and unfortunately much more complex, proof.
Authors
- Fabrizio Frati (ORCID: https://orcid.org/0000-0001-5987-8713)
- Marco D’Elia (ORCID: https://orcid.org/0009-0008-6266-3324)
Institutions
- Roma Tre University (IT)
Publication Details
- Journal
- Graphs and Combinatorics
- Published
- 2026-09-29
- DOI
- https://doi.org/10.1007/s00373-026-03066-0
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00