Cicely Henderson

activity

20242026

k

-colourable induced subgraphs in

(P_{5} + r K_{1})

-free graphs

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

collaborators

Showing 2024Show all

1 paper · 1 filter

math.CO2024★ 1 cited

Maximum $k$ -colourable induced subgraphs in $(P_{5} + r K_{1})$ -free graphs

Cicely Henderson, Evelyne Smith-Roberge, Sophie Spirkl +1

We show that for any nonnegative integer $r$ , the Weighted Maximum List- $k$ -Colourable Induced Subgraph problem can be solved in polynomial time for input graphs that do not contai…

Maximum k-colourable induced subgraphs in (P5​+rK1​)-free graphs

Maximum $k$ -colourable induced subgraphs in $(P_{5} + r K_{1})$ -free graphs