Skip to content

Author

Ben Cameron

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Obstructions to $k$-colouring $H$-free graphs

A graph is $H$-free if it has no induced subgraph isomorphic to $H$. In 2020, Chudnovsky, Goedgebeur, Schaudt, and Zhong characterized all graphs $H$ such that there are only finitely many minimal obstructions to $3$-colouring $H$-free graphs. In general, the minimal obstructions to $k$-colouring $H$-free graphs are th...

Iain Beaton, Ben Cameron, A. V. van Omme · 0 citations
Preprint Aug 2026

A dichotomy for the number of vertex-critical ($P_5$, $H$)-free graphs when $H$ is bipartite

A graph $G$ is $k$-vertex-critical if $\chi(G)=k$, but $\chi(H)<k$ for every induced subgraph $H$ of $G$. A graph $G$ is $(H_1,H_2,\dots,H_m)$-free if does not contain $H_i$ as an induced subgraph for any $i\in\{1,2,\dots,m\}$.We provide the following dichotomy that for bipartite graphs $H$ and any fixed integer $k\ge...

Iain Beaton, Ben Cameron · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.