2 citations · 2 across the 6 of their papers we have counts for
6 papers · 1 filter
A positive instance of Scott's Conjecture on induced subdivisions
Kathie Cameron, Ni Luh Dewi Sintiari, Sophie Spirkl
For a graph , denotes the chromatic number of and denotes the size of the largest clique in . A hereditary class of graphs is called -bounded if there is…
Kempe changes in -free graphs
Manoj Belavadi, Kathie Cameron
Given a -colouring of a graph and two of the colours, a is a connected component of the subgraph of induced by the vertices coloured with one of these tw…
Frozen colourings in -free graphs
Manoj Belavadi, Kathie Cameron, Elias Hildred
The \emph{reconfiguration graph of the -colourings} of a graph , denoted , is the graph whose vertices are the -colourings of and two vertices of $\m…
Recoloring via modular decomposition
Manoj Belavadi, Kathie Cameron, Ni Luh Dewi Sintiari
The reconfiguration graph of the -colorings of a graph , denoted , is the graph whose vertices are the -colorings of and two colorings are adjacent in $R_{k}…
The sandwich problem for odd-hole-free and even-hole-free graphs
Kathie Cameron, Aristotelis Chaniotis, Celina M. H. de Figueiredo +1
For a property of graphs, the -\textsc{Sandwich-Problem}, introduced by Golumbic and Shamir (1993), is the following: Given a pair of graphs …
Recoloring some hereditary graph classes
Manoj Belavadi, Kathie Cameron
The reconfiguration graph of the -colorings, denoted , is the graph whose vertices are the -colorings of and two colorings are adjacent in if they differ…