Karl Bartolo

activity

20232026

3

-path isolation problem for subcubic graphs

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

Solution to a problem on isolation of $3$ -vertex paths

Karl Bartolo, Peter Borg, Dayle Scicluna

The $3$ -path isolation number of a connected $n$ -vertex graph $G$ , denoted by $ι (G, P_{3})$ , is the size of a smallest subset $D$ of the vertex set of $G$ such that the closed neighbo…

math.CO2025★ 1 cited

Solution to a $3$ -path isolation problem for subcubic graphs

Karl Bartolo, Peter Borg, Dayle Scicluna

The $3$ -path isolation number of a connected $n$ -vertex graph $G$ , denoted by $ι (G, P_{3})$ , is the size of a smallest subset $D$ of the vertex set of $G$ such that the closed neighbo…

Solution to a problem on isolation of 3-vertex paths

Solution to a 3-path isolation problem for subcubic graphs

Solution to a problem on isolation of $3$ -vertex paths

Solution to a $3$ -path isolation problem for subcubic graphs