Rebecca Whitman

activity

20222026

k

-colourable induced subgraphs in

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

-free graphs

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

collaborators

Showing 2024Show all

3 papers · 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…

math.CO2024

Graphs Identifiable by Degree Sequence and Chromatic Number

R. Whitman

Unigraphs are graphs identifiable up to isomorphism from their degree sequences. Given a class $A$ of graphs, we define the class of $A$ -unigraphs to be graphs…

math.CO2024

Trail Trap: a variant of Partizan Edge Geography

Calum Buchanan, MacKenzie Carr, Alexander Clifton +4

We study a two-player game played on undirected graphs called {\sc Trail Trap}, which is a variant of a game known as {\sc Partizan Edge Geography}. One player starts by choosing a…

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

Graphs Identifiable by Degree Sequence and Chromatic Number

Trail Trap: a variant of Partizan Edge Geography

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