R. Brewster

activity

20172024

most citedGraph Homomorphism Reconfiguration and Frozen

H

-Colourings

4 citations · 5 across the 10 of their papers we have counts for

collaborators

14 papers

math.CO2024

Broadcast independence and packing in certain classes of trees

Richard C. Brewster, Kiara A. McDonald

Given a graph $G = (V, E)$ of diameter $d$ , a broadcast is a function $f : V (G) \to {0, 1, \dots, d}$ where $f (v)$ is at most the eccentricity of $v$ . A vertex $v$ is broadcasting i…

cs.DM2023

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…

math.CO2023

A dichotomy theorem for $Γ$ -switchable $H$ -colouring on $m$ -edge coloured graphs

Richard Brewster, Arnott Kidner, Gary MacGillivray

Let $G$ be a graph in which each edge is assigned one of the colours $1, 2, \dots, m$ , and let $Γ$ be a subgroup of $S_{m}$ . The operation of switching at a vertex $x$ of $G$ with r…

math.CO2023

The Realizability of Theta Graphs as Reconfiguration Graphs of Minimum Independent Dominating Sets

Richard Brewster, Kieka Mynhardt, Laura Teshima

The independent domination number $i (G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$ , also called an $i (G)$ -set. The $i$ -graph of $G$ is the graph…

math.CO2023

The $i$ -Graphs of Paths and Cycles

R. C. Brewster, C. M. Mynhardt, L. E. Teshima

The independent domination number $i (G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$ , also called an $i (G)$ -set. The $i$ -graph of $G$ , denoted $\m…

math.CO2023

Reconfiguration of Minimum Independent Dominating Sets in Graphs

R. C. Brewster, C. M. Mynhardt, L. E. Teshima

The independent domination number $i (G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$ , also called an $i (G)$ -set. The $i$ -graph of $G$ , denoted $\m…

Broadcast independence and packing in certain classes of trees

List homomorphisms to separable signed graphs

A dichotomy theorem for Γ-switchable H-colouring on m-edge coloured graphs

The Realizability of Theta Graphs as Reconfiguration Graphs of Minimum Independent Dominating Sets

The i-Graphs of Paths and Cycles

Reconfiguration of Minimum Independent Dominating Sets in Graphs

A dichotomy theorem for $Γ$ -switchable $H$ -colouring on $m$ -edge coloured graphs

The $i$ -Graphs of Paths and Cycles