activity
20172024
most citedGraph Homomorphism Reconfiguration and Frozen -Colourings

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

collaborators
Showing math.COShow all

5 papers · 1 filter

math.CO2024

Broadcast independence and packing in certain classes of trees

Richard C. Brewster, Kiara A. McDonald

Given a graph of diameter , a broadcast is a function where is at most the eccentricity of . A vertex is broadcasting i…

math.CO2023

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…

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 of a graph is the minimum cardinality of a maximal independent set of , also called an -set. The -graph of is the graph…

math.CO2018

Broadcast domination and multipacking: bounds and the integrality gap

Laurent Beaudou, Richard C. Brewster, Florent Foucaud

The dual concepts of coverings and packings are well studied in graph theory. Coverings of graphs with balls of radius one and packings of vertices with pairwise distances at least…

math.CO20174 cited

Graph Homomorphism Reconfiguration and Frozen -Colourings

Richard C. Brewster, Jae-Baek Lee, Benjamin Moore +2

For a fixed graph , the reconfiguration problem for -colourings (i.e. homomorphisms to ) asks: given a graph and two -colourings and of , does there exis…