Borradaile, Le and Sherman-Bennett [Graphs and Combinatorics, 2017] proved that every n-vertex 2-outerplane graph has a set of at least 2n/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.
D'Elia, M., Frati, F. (2026). On Large Induced Outerplanar Subgraphs in 2-Outerplanar Graphs. GRAPHS AND COMBINATORICS, 42(5) [10.1007/s00373-026-03066-0].
On Large Induced Outerplanar Subgraphs in 2-Outerplanar Graphs
D'Elia, Marco;Frati, Fabrizio
2026-01-01
Abstract
Borradaile, Le and Sherman-Bennett [Graphs and Combinatorics, 2017] proved that every n-vertex 2-outerplane graph has a set of at least 2n/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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
