English

On Large Induced Outerplanar Subgraphs in $2$-Outerplanar Graphs

Combinatorics 2026-02-23 v1 Discrete Mathematics

Abstract

Borradaile, Le and Sherman-Bennett [Graphs and Combinatorics, 2017] proved that every nn-vertex 22-outerplane graph has a set of at least 2n/32n/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.

Keywords

Cite

@article{arxiv.2602.18121,
  title  = {On Large Induced Outerplanar Subgraphs in $2$-Outerplanar Graphs},
  author = {Marco D'Elia and Fabrizio Frati},
  journal= {arXiv preprint arXiv:2602.18121},
  year   = {2026}
}
R2 v1 2026-07-01T10:44:02.597Z