Marco D'Elia

works on

algorithmic complexity 1 biconnected graphs 1 fixed embedding 1 partial drawing extension 1 planar graphs 1

From the 1 of 6 linked papers with an AI index.

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2026

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

Marco D'Elia, Fabrizio Frati

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 outerpla…

math.CO2025

Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs

Marco D'Elia, Fabrizio Frati

In this paper, we study the following question. Let $G$ be a family of planar graphs and let $k \geq 3$ be an integer. What is the largest value $f_{k} (n)$ such that every $n…

On Large Induced Outerplanar Subgraphs in 2-Outerplanar Graphs

Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs

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