Ben Cameron

collaborators

2 papers

math.CO2024

On the finiteness of $k$ -vertex-critical $2 P_{2}$ -free graphs with forbidden induced squids or bulls

Melvin Adekanye, Christopher Bury, Ben Cameron +1

A graph is $k$ -vertex-critical if $χ (G) = k$ but $χ (G - v) < k$ for all $v \in V (G)$ and $(G, H)$ -free if it contains no induced subgraph isomorphic to $G$ or $H$ . We show that there are o…

math.CO2024

An approximation algorithm for zero forcing

Ben Cameron, Jeannette Janssen, Rogers Matthew +1

We give an algorithm that finds a zero forcing set which approximates the optimal size by a factor of $pw (G) + 1$ , where $pw (G)$ is the pathwidth of $G$ . Starting from…

On the finiteness of k-vertex-critical 2P2​-free graphs with forbidden induced squids or bulls

An approximation algorithm for zero forcing

On the finiteness of $k$ -vertex-critical $2 P_{2}$ -free graphs with forbidden induced squids or bulls