Richard C. Brewster

According to our database, Richard C. Brewster authored at least 42 papers between 1989 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Characterizing circular colouring mixing for p q 4 $\frac{p}{q}\lt 4$.

Richard C. Brewster, Benjamin R. Moore

J. Graph Theory, 2023

List homomorphism problems for signed trees.

Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková

Discret. Math., 2023

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

Richard C. Brewster, Arnott Kidner, Gary MacGillivray

CoRR, 2023

2022

The 2-colouring problem for (m,n)-mixed graphs with switching is polynomial.

Richard C. Brewster, Arnott Kidner, Gary MacGillivray

Discret. Math. Theor. Comput. Sci., 2022

Edge-coloured graph homomorphisms, paths, and duality.

Kyle Booker, Richard C. Brewster

CoRR, 2022

Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs.

Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

List Homomorphisms to Separable Signed Graphs.

Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021

Reconfiguration of homomorphisms to reflexive digraph cycles.

Richard C. Brewster, Jae-Baek Lee, Mark H. Siggers

Discret. Math., 2021

2020

Graph homomorphism reconfiguration and frozen H-colorings.

Richard C. Brewster, Jae-Baek Lee, Benjamin R. Moore, Jonathan A. Noel, Mark H. Siggers

J. Graph Theory, 2020

List Homomorphism Problems for Signed Graphs.

Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

On the multipacking number of grid graphs.

Laurent Beaudou, Richard C. Brewster

Discret. Math. Theor. Comput. Sci., 2019

Broadcast domination and multipacking in strongly chordal graphs.

Richard C. Brewster, Gary MacGillivray, Feiran Yang

Discret. Appl. Math., 2019

Broadcast domination and multipacking: bounds and the integrality gap.

Laurent Beaudou, Richard C. Brewster, Florent Foucaud

Australas. J Comb., 2019

2018

A complexity dichotomy for signed H-colouring.

Richard C. Brewster, Mark H. Siggers

Discret. Math., 2018

Recolouring reflexive digraphs.

Richard C. Brewster, Jae-Baek Lee, Mark H. Siggers

Discret. Math., 2018

2017

The complexity of signed graph and edge-coloured graph homomorphisms.

Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr

Discret. Math., 2017

Graph Homomorphism Reconfiguration and Frozen H-Colourings.

Richard C. Brewster, Jae-Baek Lee, Benjamin R. Moore, Jonathan A. Noel, Mark H. Siggers

CoRR, 2017

2016

A dichotomy theorem for circular colouring reconfiguration.

Richard C. Brewster, Sean McGuinness, Benjamin R. Moore, Jonathan A. Noel

Theor. Comput. Sci., 2016

2015

Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings.

Richard C. Brewster, Jonathan A. Noel

J. Graph Theory, 2015

The complexity of signed graph and 2-edge-coloured graph homomorphisms.

Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr

CoRR, 2015

2014

Mixing Homomorphisms, Recolourings, and Extending Circular Precolourings.

Richard C. Brewster, Jonathan A. Noel

CoRR, 2014

2013

Factors with Multiple Degree Constraints in Graphs.

Richard C. Brewster, Sean McGuinness, Morten Hegner Nielsen

SIAM J. Discret. Math., 2013

2012

On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs.

Richard C. Brewster, Daryl Funk

J. Graph Theory, 2012

Extending precolourings of circular cliques.

Richard C. Brewster, Jonathan A. Noel

Discret. Math., 2012

Lexicographic products with high reconstruction numbers.

Richard C. Brewster, Gena Hahn, Stacey Wynn Lamont, Chester Lipka

Discret. Math., 2012

2009

The circular chromatic number of hypergraphs.

Richard C. Brewster, Gary MacGillivray, Laura Shepherd

Discret. Math., 2009

Edge-switching homomorphisms of edge-coloured graphs.

Richard C. Brewster, Timothy Graves

Discret. Math., 2009

2008

Near-Unanimity Functions and Varieties of Reflexive Graphs.

Richard C. Brewster, Tomás Feder, Pavol Hell, Jing Huang, Gary MacGillivray

SIAM J. Discret. Math., 2008

Oriented star packings.

Richard C. Brewster, Pavol Hell, Romeo Rizzi

J. Comb. Theory, Ser. B, 2008

On the restricted homomorphism problem.

Richard C. Brewster, Timothy Graves

Discret. Appl. Math., 2008

2006

Building blocks for the variety of absolute retracts.

Richard C. Brewster, Gary MacGillivray

Discret. Math., 2006

2005

The recognition of bound quivers using edge-coloured homomorphisms.

Richard C. Brewster, Renato Dedic, François Huard, Jeffery Queen

Discret. Math., 2005

2003

Packing paths in digraphs.

Richard C. Brewster, Pavol Hell, Sarah H. Pantel, Romeo Rizzi, Anders Yeo

J. Graph Theory, 2003

On the complexity of digraph packings.

Richard C. Brewster, Romeo Rizzi

Inf. Process. Lett., 2003

2002

Homomorphisms to powers of digraphs.

Richard C. Brewster, Pavol Hell

Discret. Math., 2002

2001

Minimizing b + D and well covered graphs.

Richard C. Brewster, Gary MacGillivray

Ars Comb., 2001

2000

On homomorphisms to edge-coloured cycles.

Richard C. Brewster, Pavol Hell

Electron. Notes Discret. Math., 2000

1997

The complexity of restricted graph homomorphisms.

Richard C. Brewster, Pavol Hell, Gary MacGillivray

Discret. Math., 1997

1996

Homomorphically Full Graphs.

Richard C. Brewster, Gary MacGillivray

Discret. Appl. Math., 1996

1994

The Complexity of Colouring Symmetric Relational Systems.

Richard C. Brewster

Discret. Appl. Math., 1994

1991

A Note on Restricted H-Colouring.

Richard C. Brewster, Gary MacGillivray

Inf. Process. Lett., 1991

1989

Irredundant ramsey numbers for graphs.

Richard C. Brewster, Ernest J. Cockayne, Christina M. Mynhardt

J. Graph Theory, 1989