| 2008 |
|---|
| 28 | | K. Reji Kumar,
S. Arumugam,
Gary MacGillivray:
On Maximal Fractional Independent Sets In Graphs.
Ars Comb. 87: (2008) |
| 27 | 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) |
| 2007 |
|---|
| 26 | EE | Stephen Finbow,
Andrew King,
Gary MacGillivray,
Romeo Rizzi:
The firefighter problem for graphs of maximum degree three.
Discrete Mathematics 307(16): 2094-2105 (2007) |
| 2006 |
|---|
| 25 | EE | Richard C. Brewster,
Gary MacGillivray:
Building blocks for the variety of absolute retracts.
Discrete Mathematics 306(15): 1758-1764 (2006) |
| 24 | EE | Gena Hahn,
Gary MacGillivray:
A note on k-cop, l-robber games on graphs.
Discrete Mathematics 306(19-20): 2492-2497 (2006) |
| 2005 |
|---|
| 23 | | Shannon L. Fitzpatrick,
Gary MacGillivray:
Non 3-Choosable Bipartite Graphs and The Fano Plane.
Ars Comb. 76: (2005) |
| 2004 |
|---|
| 22 | EE | William Klostermeyer,
Gary MacGillivray:
Homomorphisms and oriented colorings of equivalence classes of oriented graphs.
Discrete Mathematics 274(1-3): 161-172 (2004) |
| 2003 |
|---|
| 21 | | Ruth Haas,
Denis Hanson,
Gary MacGillivray:
Bounds For Partial List Colourings.
Ars Comb. 67: (2003) |
| 2002 |
|---|
| 20 | | Jing Huang,
Gary MacGillivray,
Anders Yeo:
Pushing vertices in digraphs without long induced cycles.
Discrete Applied Mathematics 121(1-3): 181-192 (2002) |
| 19 | EE | Sheila Ferneyhough,
Ruth Haas,
Denis Hanson,
Gary MacGillivray:
Star forests, dominating sets and Ramsey-type problems.
Discrete Mathematics 245(1-3): 255-262 (2002) |
| 18 | EE | Shannon L. Fitzpatrick,
Gary MacGillivray,
Devon McCrea:
Total domination in complements of graphs containing no K4, 4.
Discrete Mathematics 254(1-3): 143-151 (2002) |
| 2001 |
|---|
| 17 | | Richard C. Brewster,
Gary MacGillivray:
Minimizing b + D and well covered graphs.
Ars Comb. 61: (2001) |
| 16 | EE | Jing Huang,
Gary MacGillivray,
Kathryn L. B. Wood:
Pushing the cycles out of multipartite tournaments.
Discrete Mathematics 231(1-3): 279-287 (2001) |
| 15 | EE | Gary MacGillivray,
A. Rodriguez:
The achromatic number of the union of paths.
Discrete Mathematics 231(1-3): 331-335 (2001) |
| 2000 |
|---|
| 14 | | Gary MacGillivray,
Kathryn L. B. Wood:
Re-Orienting Tournaments by Pushing Vertices.
Ars Comb. 57: (2000) |
| 1997 |
|---|
| 13 | EE | Richard C. Brewster,
Pavol Hell,
Gary MacGillivray:
The complexity of restricted graph homomorphisms.
Discrete Mathematics 167-168: 145-154 (1997) |
| 1996 |
|---|
| 12 | | Denis Hanson,
Gary MacGillivray,
Bjarne Toft:
Choosability of bipartite graphs.
Ars Comb. 44: (1996) |
| 11 | EE | Richard C. Brewster,
Gary MacGillivray:
Homomorphically Full Graphs.
Discrete Applied Mathematics 66(1): 23-31 (1996) |
| 1995 |
|---|
| 10 | EE | Jørgen Bang-Jensen,
Pavol Hell,
Gary MacGillivray:
Hereditarily hard H-colouring problems.
Discrete Mathematics 138(1-3): 75-92 (1995) |
| 1994 |
|---|
| 9 | EE | Gary MacGillivray:
Graph Homomorphisms with Infinite Targets.
Discrete Applied Mathematics 54(1): 29-35 (1994) |
| 8 | EE | Ernest J. Cockayne,
Gary MacGillivray,
Christina M. Mynhardt:
Convexity of minimal dominating functions of trees - II.
Discrete Mathematics 125(1-3): 137-146 (1994) |
| 1993 |
|---|
| 7 | EE | Denis Hanson,
Gary MacGillivray,
Dale Youngs:
The size of a minimum five-chromatic K4-free graph.
Discrete Mathematics 122(1-3): 353-355 (1993) |
| 1992 |
|---|
| 6 | EE | Jørgen Bang-Jensen,
Pavol Hell,
Gary MacGillivray:
On the complexity of colouring by superdigraphs of bipartite graphs.
Discrete Mathematics 109(1-3): 27-44 (1992) |
| 1991 |
|---|
| 5 | EE | Ernest J. Cockayne,
Odile Favaron,
Hao Li,
Gary MacGillivray:
The product of the independent domination numbers of a graph and its complement.
Discrete Mathematics 90(3): 313-317 (1991) |
| 4 | | Richard C. Brewster,
Gary MacGillivray:
A Note on Restricted H-Colouring.
Inf. Process. Lett. 40(3): 149-151 (1991) |
| 3 | | Gary MacGillivray:
On the Complexity of Colouring by Vertex-Transitive and Arc-Transistive Digraphs.
SIAM J. Discrete Math. 4(3): 397-408 (1991) |
| 1989 |
|---|
| 2 | | John A. Ellis,
Manrique Mata,
Gary MacGillivray:
A Linear Time Algorithm for Longest (s,t)-Paths in Weighted Outer Planar Graphs.
Inf. Process. Lett. 32(4): 199-204 (1989) |
| 1988 |
|---|
| 1 | | Jørgen Bang-Jensen,
Pavol Hell,
Gary MacGillivray:
The Complexity of Colouring by Semicomplete Digraphs.
SIAM J. Discrete Math. 1(3): 281-298 (1988) |
