Karl Bartolo

collaborators

3 papers

math.CO2026

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 $I^^{1} (G, P_{3})$ , is the size of a smallest subset $D$ of the vertex set of $G$ such that the closed neighb…

math.CO2026

Isolation critical graphs under multiple edge subdivision

Karl Bartolo, Peter Borg, Magda Dettlaff +2

This paper introduces the notion of an $(I^^{1}, q)$ -critical graph. The isolation number of a graph $G$ , denoted by $I^^{1} (G)$ and also known as the vertex-edge domination number of $G$ ,…

math.CO2025

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