2008 |
13 | EE | Richard C. Brewster,
Timothy Graves:
On the restricted homomorphism problem.
Discrete Applied Mathematics 156(14): 2823-2826 (2008) |
12 | EE | Richard C. Brewster,
Pavol Hell,
Romeo Rizzi:
Oriented star packings.
J. Comb. Theory, Ser. B 98(3): 558-576 (2008) |
11 | EE | Richard C. Brewster,
Tomás Feder,
Pavol Hell,
Jing Huang,
Gary MacGillivray:
Near-Unanimity Functions and Varieties of Reflexive Graphs.
SIAM J. Discrete Math. 22(3): 938-960 (2008) |
2006 |
10 | EE | Richard C. Brewster,
Gary MacGillivray:
Building blocks for the variety of absolute retracts.
Discrete Mathematics 306(15): 1758-1764 (2006) |
2005 |
9 | EE | Richard C. Brewster,
Renato Dedic,
François Huard,
Jeffery Queen:
The recognition of bound quivers using edge-coloured homomorphisms.
Discrete Mathematics 297(1-3): 13-25 (2005) |
2003 |
8 | EE | Richard C. Brewster,
Romeo Rizzi:
On the complexity of digraph packings.
Inf. Process. Lett. 86(2): 101-106 (2003) |
2002 |
7 | EE | Richard C. Brewster,
Pavol Hell:
Homomorphisms to powers of digraphs.
Discrete Mathematics 244(1-3): 31-41 (2002) |
2001 |
6 | | Richard C. Brewster,
Gary MacGillivray:
Minimizing b + D and well covered graphs.
Ars Comb. 61: (2001) |
2000 |
5 | EE | Richard C. Brewster,
Pavol Hell:
On homomorphisms to edge-coloured cycles.
Electronic Notes in Discrete Mathematics 5: 46-49 (2000) |
1997 |
4 | EE | Richard C. Brewster,
Pavol Hell,
Gary MacGillivray:
The complexity of restricted graph homomorphisms.
Discrete Mathematics 167-168: 145-154 (1997) |
1996 |
3 | EE | Richard C. Brewster,
Gary MacGillivray:
Homomorphically Full Graphs.
Discrete Applied Mathematics 66(1): 23-31 (1996) |
1994 |
2 | | Richard C. Brewster:
The Complexity of Colouring Symmetric Relational Systems.
Discrete Applied Mathematics 49(1-3): 95-105 (1994) |
1991 |
1 | | Richard C. Brewster,
Gary MacGillivray:
A Note on Restricted H-Colouring.
Inf. Process. Lett. 40(3): 149-151 (1991) |