16 citations · 28 across the 10 of their papers we have counts for
11 papers
On graphs without four-vertex induced subgraphs
Kathie Cameron, Chính T. Hoàng, Taite LaGrange
Given a family F of graphs, a graph G is F-free if it does not contain any graph in F as an induced subgraph. The problem of determining the complexity of colouring (claw, 4K1)- fr…
Reconfiguration of vertex colouring and forbidden induced subgraphs
Manoj Belavadi, Kathie Cameron, Owen Merkel
The reconfiguration graph of the -colourings, denoted , is the graph whose vertices are the -colourings of and two colourings are adjacent in $\mathcal{…
-Critical Graphs in -Free Graphs
Kathie Cameron, Jan Goedgebeur, Shenwei Huang +1
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let be the path on vertices. A graph $G…
An Optimal -Bound for (, diamond)-Free Graphs
Kathie Cameron, Shenwei Huang, Owen Merkel
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let be the path on vertices and b…
The class of -free graphs: decomposition, algorithms, and -boundedness
Kathie Cameron, Shenwei Huang, Irena Penev +1
As usual, () denotes the path on vertices, and () denotes the cycle on vertices. For a family of graphs, we say that a graph $…
Solving the clique cover problem on (bull, )-free graphs
Kathie Cameron, Chính T. Hoàng
We give an algorithm to find a minimum clique cover of a (bull, )-free graph, or equivalently, a minimum colouring of a (bull, )-free graph, where is the nu…