Richard C. Brewster

发表

Homomorphically Full Graphs

Richard C. Brewster, Gary MacGillivray, G. MacGillivray, 1996, Discret. Appl. Math..

On the complexity of digraph packings

Richard C. Brewster, Romeo Rizzi, 2003, Inf. Process. Lett..

A dichotomy theorem for circular colouring reconfiguration

Richard C. Brewster, Sean McGuinness, Benjamin Moore, 2015, Theor. Comput. Sci..

Oriented star packings

Richard C. Brewster, Pavol Hell, Romeo Rizzi, 2008, J. Comb. Theory, Ser. B.

Recolouring reflexive digraphs

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

The recognition of bound quivers using edge-coloured homomorphisms

Richard C. Brewster, Renato Dedic, François Huard, 2005, Discret. Math..

Broadcast domination and multipacking in strongly chordal graphs

Richard C. Brewster, Gary MacGillivray, Feiran Yang, 2019, Discret. Appl. Math..

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

Richard C. Brewster, Pavol Hell, Florent Foucaud, 2015, Discret. Math..

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

Richard C. Brewster, Daryl Funk, R. Brewster, 2012, J. Graph Theory.

Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings

Richard C. Brewster, Jonathan A. Noel, R. Brewster, 2015, J. Graph Theory.

Homomorphisms to powers of digraphs

Richard C. Brewster, Pavol Hell, 2002, Discret. Math..

Mixing Homomorphisms, Recolourings, and Extending Circular Precolourings pdf

Richard C. Brewster, Jonathan A. Noel, 2014, ArXiv.

A complexity dichotomy for signed H-colouring

Richard C. Brewster, Mark H. Siggers, 2018, Discret. Math..

The Complexity of Colouring Symmetric Relational Systems

Richard C. Brewster, 1994, Discret. Appl. Math..

Near-Unanimity Functions and Varieties of Reflexive Graphs

Richard C. Brewster, Gary MacGillivray, Pavol Hell, 2008, SIAM J. Discret. Math..

Factors with Multiple Degree Constraints in Graphs

Richard C. Brewster, Morten Hegner Nielsen, Sean McGuinness, 2013, SIAM J. Discret. Math..

Extending precolourings of circular cliques

Richard C. Brewster, Jonathan A. Noel, 2012, Discret. Math..

Minimizing b + D and well covered graphs

Richard C. Brewster, Gary MacGillivray, 2001, Ars Comb..

Lexicographic products with high reconstruction numbers

Richard C. Brewster, Gena Hahn, Stacey Wynn Lamont, 2012, Discret. Math..

Packing paths in digraphs

Richard C. Brewster, Anders Yeo, Pavol Hell, 2003, J. Graph Theory.

A Note on Restricted H-Colouring

Richard C. Brewster, Gary MacGillivray, 1991, Inf. Process. Lett..

The complexity of restricted graph homomorphisms

Richard C. Brewster, Gary MacGillivray, Pavol Hell, 1997, Discret. Math..

On the restricted homomorphism problem

Richard C. Brewster, Timothy Graves, 2008, Discret. Appl. Math..

Building blocks for the variety of absolute retracts

Richard C. Brewster, Gary MacGillivray, 2006, Discret. Math..

Graph Homomorphism Reconfiguration and Frozen H-Colourings pdf

Richard C. Brewster, Mark H. Siggers, Benjamin Moore, 2020, J. Graph Theory.

Irredundant ramsey numbers for graphs

Richard C. Brewster, Ernest J. Cockayne, Christina M. Mynhardt, 1989, J. Graph Theory.

Edge-switching homomorphisms of edge-coloured graphs

Richard C. Brewster, Timothy Graves, 2009, Discret. Math..

On homomorphisms to edge-coloured cycles

Richard C. Brewster, Pavol Hell, 2000, Electron. Notes Discret. Math..

The circular chromatic number of hypergraphs

Richard C. Brewster, Gary MacGillivray, Laura Shepherd, 2009, Discret. Math..

Reconfiguration of homomorphisms to reflexive digraph cycles

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

New bounds for the broadcast domination number of a graph

Richard C. Brewster, Christina M. Mynhardt, Laura E. Teshima, 2013 .

Packing paths in digraphs

Richard C. Brewster, Anders Yeo, Pavol Hell, 2003 .