Richard C. Brewster

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 23

Top Topics

Integrality Gap

Harmonic Functions

Graph Theoretic

Top Venues

J. Graph Theory

Discret. Math. Theor. Comput. Sci.

Publications

Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey
Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs. Algorithmica 86 (7) (2024)
Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
List homomorphisms to separable signed graphs. Theor. Comput. Sci. 1001 (2024)
Richard C. Brewster, Arnott Kidner, Gary MacGillivray
A dichotomy theorem for Γ-switchable H-colouring on m-edge coloured graphs. CoRR (2023)
Richard C. Brewster, Benjamin R. Moore
Characterizing circular colouring mixing for p q 4 $\frac{p}{q}\lt 4$. J. Graph Theory 102 (2) (2023)
Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
List homomorphisms to separable signed graphs. CoRR (2023)
Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
List homomorphism problems for signed trees. Discret. Math. 346 (3) (2023)
Kyle Booker, Richard C. Brewster
Edge-coloured graph homomorphisms, paths, and duality. CoRR (2022)
Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey
Min orderings and list homomorphism dichotomies for signed and unsigned graphs. CoRR (2022)
Richard C. Brewster, Arnott Kidner, Gary MacGillivray
The 2-colouring problem for $(m, n)$-mixed graphs with switching is polynomial. Discret. Math. Theor. Comput. Sci. 24 (2) (2022)
Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
List Homomorphisms to Separable Signed Graphs. CALDAM (2022)
Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey
Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs. LATIN (2022)
Richard C. Brewster, Jae-Baek Lee, Mark H. Siggers
Reconfiguration of homomorphisms to reflexive digraph cycles. Discret. Math. 344 (8) (2021)
Richard C. Brewster, Jae-Baek Lee, Benjamin Moore, Jonathan A. Noel, Mark H. Siggers
Graph homomorphism reconfiguration and frozen H-colorings. J. Graph Theory 94 (3) (2020)
Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
List homomorphism problems for signed graphs. CoRR (2020)
Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
List Homomorphism Problems for Signed Graphs. MFCS (2020)
Richard C. Brewster, Gary MacGillivray, Feiran Yang
Broadcast domination and multipacking in strongly chordal graphs. Discret. Appl. Math. 261 (2019)
Laurent Beaudou, Richard C. Brewster
On the multipacking number of grid graphs. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Laurent Beaudou, Richard C. Brewster, Florent Foucaud
Broadcast domination and multipacking: bounds and the integrality gap. Australas. J Comb. 74 (2019)
Richard C. Brewster, Jae-Baek Lee, Mark H. Siggers
Recolouring reflexive digraphs. Discret. Math. 341 (6) (2018)
Richard C. Brewster, Mark H. Siggers
A complexity dichotomy for signed H-colouring. Discret. Math. 341 (10) (2018)
Richard C. Brewster, Jae-Baek Lee, Benjamin Moore, Jonathan A. Noel, Mark H. Siggers
Graph Homomorphism Reconfiguration and Frozen H-Colourings. CoRR (2017)
Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr
The complexity of signed graph and edge-coloured graph homomorphisms. Discret. Math. 340 (2) (2017)
Richard C. Brewster, Sean McGuinness, Benjamin Moore, Jonathan A. Noel
A dichotomy theorem for circular colouring reconfiguration. Theor. Comput. Sci. 639 (2016)
Richard C. Brewster, Jonathan A. Noel
Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings. J. Graph Theory 80 (3) (2015)
Richard C. Brewster, Sean McGuinness, Benjamin Moore, Jonathan A. Noel
A Dichotomy Theorem for Circular Colouring Reconfiguration. CoRR (2015)
Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr
The complexity of signed graph and 2-edge-coloured graph homomorphisms. CoRR (2015)
Richard C. Brewster, Jonathan A. Noel
Mixing Homomorphisms, Recolourings, and Extending Circular Precolourings. CoRR (2014)
Richard C. Brewster, Sean McGuinness, Morten Hegner Nielsen
Factors with Multiple Degree Constraints in Graphs. SIAM J. Discret. Math. 27 (4) (2013)
Richard C. Brewster, Gena Hahn, Stacey Wynn Lamont, Chester Lipka
Lexicographic products with high reconstruction numbers. Discret. Math. 312 (10) (2012)
Richard C. Brewster, Daryl Funk
On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs. J. Graph Theory 71 (2) (2012)
Richard C. Brewster, Jonathan A. Noel
Extending precolourings of circular cliques. Discret. Math. 312 (1) (2012)
Richard C. Brewster, Timothy Graves
Edge-switching homomorphisms of edge-coloured graphs. Discret. Math. 309 (18) (2009)
Richard C. Brewster, Gary MacGillivray, Laura Shepherd
The circular chromatic number of hypergraphs. Discret. Math. 309 (18) (2009)
Richard C. Brewster, Pavol Hell, Romeo Rizzi
Oriented star packings. J. Comb. Theory, Ser. B 98 (3) (2008)
Richard C. Brewster, Tomás Feder, Pavol Hell, Jing Huang, Gary MacGillivray
Near-Unanimity Functions and Varieties of Reflexive Graphs. SIAM J. Discret. Math. 22 (3) (2008)
Richard C. Brewster, Timothy Graves
On the restricted homomorphism problem. Discret. Appl. Math. 156 (14) (2008)
Richard C. Brewster, Gary MacGillivray
Building blocks for the variety of absolute retracts. Discret. Math. 306 (15) (2006)
Richard C. Brewster, Renato Dedic, François Huard, Jeffery Queen
The recognition of bound quivers using edge-coloured homomorphisms. Discret. Math. 297 (1-3) (2005)
Richard C. Brewster, Romeo Rizzi
On the complexity of digraph packings. Inf. Process. Lett. 86 (2) (2003)
Richard C. Brewster, Pavol Hell, Sarah H. Pantel, Romeo Rizzi, Anders Yeo
Packing paths in digraphs. J. Graph Theory 44 (2) (2003)
Richard C. Brewster, Pavol Hell
Homomorphisms to powers of digraphs. Discret. Math. 244 (1-3) (2002)
Richard C. Brewster, Gary MacGillivray
Minimizing b + D and well covered graphs. Ars Comb. 61 (2001)
Richard C. Brewster, Pavol Hell
On homomorphisms to edge-coloured cycles. Electron. Notes Discret. Math. 5 (2000)
Richard C. Brewster, Pavol Hell, Gary MacGillivray
The complexity of restricted graph homomorphisms. Discret. Math. (1997)
Richard C. Brewster, Gary MacGillivray
Homomorphically Full Graphs. Discret. Appl. Math. 66 (1) (1996)
Richard C. Brewster
The Complexity of Colouring Symmetric Relational Systems. Discret. Appl. Math. 49 (1-3) (1994)
Richard C. Brewster, Gary MacGillivray
A Note on Restricted H-Colouring. Inf. Process. Lett. 40 (3) (1991)
Richard C. Brewster, Ernest J. Cockayne, Christina M. Mynhardt
Irredundant ramsey numbers for graphs. J. Graph Theory 13 (3) (1989)