Richard C. Brewster

49 papers B 2Journal 46Unranked 1

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