Ben Cameron

activity

20222026

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

On Gyárfás' Path-Colour Problem

Ben Cameron, Alexander Clow

In their 1997 paper titled ``Fruit Salad", Gyárfás posed the following conjecture: there exists a constant $k$ such that if each path of a graph spans a $3$ -colourable subgraph, th…

math.CO2025

Critical $(P_{5}, W_{4})$ -Free Graphs

Wen Xia, Jorik Jooken, Jan Goedgebeur +3

A graph $G$ is $k$ -vertex-critical if $χ (G) = k$ but $χ (G - v) < k$ for all $v \in V (G)$ . A graph is $(H_{1}, H_{2})$ -free if it contains no induced subgraph isomorphic to $H_{1}$ nor $H_{2}$ .…

On Gyárfás' Path-Colour Problem

Critical (P5​,W4​)-Free Graphs

Critical $(P_{5}, W_{4})$ -Free Graphs