35 citations · 50 across the 16 of their papers we have counts for
5 papers · 1 filter
List homomorphisms to separable signed graphs
Jan Bok, Richard Brewster, Tomás Feder +2
The complexity of the list homomorphism problem for signed graphs appears difficult to classify. Existing results focus on special classes of signed graphs, such as trees and refle…
A dichotomy theorem for -switchable -colouring on -edge coloured graphs
Richard Brewster, Arnott Kidner, Gary MacGillivray
Let be a graph in which each edge is assigned one of the colours , and let be a subgroup of . The operation of switching at a vertex of with r…
The Realizability of Theta Graphs as Reconfiguration Graphs of Minimum Independent Dominating Sets
Richard Brewster, Kieka Mynhardt, Laura Teshima
The independent domination number of a graph is the minimum cardinality of a maximal independent set of , also called an -set. The -graph of is the graph…
The -Graphs of Paths and Cycles
R. C. Brewster, C. M. Mynhardt, L. E. Teshima
The independent domination number of a graph is the minimum cardinality of a maximal independent set of , also called an -set. The -graph of , denoted $\m…
Reconfiguration of Minimum Independent Dominating Sets in Graphs
R. C. Brewster, C. M. Mynhardt, L. E. Teshima
The independent domination number of a graph is the minimum cardinality of a maximal independent set of , also called an -set. The -graph of , denoted $\m…