Indexed metadata
On Large Induced Outerplanar Subgraphs in 2-Outerplanar Graphs
Marco D’Elia, Fabrizio Frati
Source record
Source: Crossref
Published: Sep 29, 2026
DOI: 10.1007/s00373-026-03066-0
Open original source ↗Source abstract
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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.