R. Whitman

collaborators

3 papers

math.CO2025

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.CO2025

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…

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…

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

Trail Trap: a variant of Partizan Edge Geography

Graphs Identifiable by Degree Sequence and Chromatic Number

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