The Complexity of Colouring by Semicomplete Digraphs. - Jørgen Bang-Jensen; Pavol Hell; Gary MacGillivray (SIAM J. Discret. Math., 1988)

A Linear Time Algorithm for Longest (s,t)-Paths in Weighted Outer Planar Graphs. - John A. Ellis; Manrique Mata; Gary MacGillivray (Inf. Process. Lett., 1989)

The product of the independent domination numbers of a graph and its complement. - Ernest J. Cockayne; Odile Favaron; Hao Li 002; Gary MacGillivray (Discret. Math., 1991)

A Note on Restricted H-Colouring. - Richard C. Brewster; Gary MacGillivray (Inf. Process. Lett., 1991)

On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs. - Gary MacGillivray (SIAM J. Discret. Math., 1991)

On the complexity of colouring by superdigraphs of bipartite graphs. - Jørgen Bang-Jensen; Pavol Hell; Gary MacGillivray (Discret. Math., 1992)

The size of a minimum five-chromatic K4-free graph. - Denis Hanson; Gary MacGillivray; Dale Youngs (Discret. Math., 1993)

Graph Homomorphisms with Infinite Targets. - Gary MacGillivray (Discret. Appl. Math., 1994)

Convexity of minimal dominating functions of trees - II. - Ernest J. Cockayne; Gary MacGillivray; Christina M. Mynhardt (Discret. Math., 1994)

A note on minimum graphs with girth pair (4, 2l + 1). - Denis Hanson; Ping Wang; Gary MacGillivray (J. Graph Theory, 1994)

Hereditarily hard H-colouring problems. - Jørgen Bang-Jensen; Pavol Hell; Gary MacGillivray (Discret. Math., 1995)

Vertex domination-critical graphs. - Jason E. Fulman; Denis Hanson; Gary MacGillivray (Networks, 1995)

Choosability of bipartite graphs. - Denis Hanson; Gary MacGillivray; Bjarne Toft (Ars Comb., 1996)

Homomorphically Full Graphs. - Richard C. Brewster; Gary MacGillivray (Discret. Appl. Math., 1996)

Domination critical graphs with higher independent domination numbers. - S. Ao; Ernest J. Cockayne; Gary MacGillivray; Christina M. Mynhardt (J. Graph Theory, 1996)

Domination numbers of planar graphs. - Gary MacGillivray; Karen Seyffarth (J. Graph Theory, 1996)

The complexity of restricted graph homomorphisms. - Richard C. Brewster; Pavol Hell; Gary MacGillivray (Discret. Math., 1997)

Re-Orienting Tournaments by Pushing Vertices. - Gary MacGillivray; Kathryn L. B. Wood (Ars Comb., 2000)

CO-irredundant Ramsey numbers for graphs. - Ernest J. Cockayne; Gary MacGillivray; Jill Simmons (J. Graph Theory, 2000)

Classes of line graphs with small cycle double covers. - Gary MacGillivray; Karen Seyffarth (Australas. J Comb., 2001)

Minimizing b + D and well covered graphs. - Richard C. Brewster; Gary MacGillivray (Ars Comb., 2001)

Pushing the cycles out of multipartite tournaments. - Jing Huang 007; Gary MacGillivray; Kathryn L. B. Wood (Discret. Math., 2001)

The achromatic number of the union of paths. - Gary MacGillivray; A. Rodriguez (Discret. Math., 2001)

Pushing vertices in digraphs without long induced cycles. - Jing Huang 007; Gary MacGillivray; Anders Yeo (Discret. Appl. Math., 2002)

Star forests, dominating sets and Ramsey-type problems. - Sheila Ferneyhough; Ruth Haas; Denis Hanson; Gary MacGillivray (Discret. Math., 2002)

Total domination in complements of graphs containing no K4, 4. - Shannon L. Fitzpatrick; Gary MacGillivray; Devon McCrea (Discret. Math., 2002)

Bounds For Partial List Colourings. - Ruth Haas; Denis Hanson; Gary MacGillivray (Ars Comb., 2003)

Homomorphisms and oriented colorings of equivalence classes of oriented graphs. - William Klostermeyer; Gary MacGillivray (Discret. Math., 2004)

Analogues of cliques for oriented coloring. - William Klostermeyer; Gary MacGillivray (Discuss. Math. Graph Theory, 2004)

Non 3-Choosable Bipartite Graphs and The Fano Plane. - Shannon L. Fitzpatrick; Gary MacGillivray (Ars Comb., 2005)

Building blocks for the variety of absolute retracts. - Richard C. Brewster; Gary MacGillivray (Discret. Math., 2006)

A note on k-cop, l-robber games on graphs. - Gena Hahn; Gary MacGillivray (Discret. Math., 2006)

Bounds on the achromatic number of partial triple systems. - Peter Dukes; Gary MacGillivray; Kristen Parton (Contributions Discret. Math., 2007)

The firefighter problem for graphs of maximum degree three. - Stephen Finbow; Andrew D. King; Gary MacGillivray; Romeo Rizzi (Discret. Math., 2007)

On Maximal Fractional Independent Sets In Graphs. - K. Reji Kumar; S. Arumugam 001; Gary MacGillivray (Ars Comb., 2008)

Near-Unanimity Functions and Varieties of Reflexive Graphs. - Richard C. Brewster; Tomás Feder; Pavol Hell; Jing Huang 007; Gary MacGillivray (SIAM J. Discret. Math., 2008)

Injective Oriented Colourings. - Gary MacGillivray; André Raspaud; Jacobus Swarts (WG, 2009)

The Firefighter Problem: a survey of results, directions and questions. - Stephen Finbow; Gary MacGillivray (Australas. J Comb., 2009)

The circular chromatic number of hypergraphs. - Richard C. Brewster; Gary MacGillivray; Laura Shepherd (Discret. Math., 2009)

On the complexity of H-colouring planar graphs. - Gary MacGillivray; Mark H. Siggers (Discret. Math., 2009)

The complexity of colouring by locally semicomplete digraphs. - Jørgen Bang-Jensen; Gary MacGillivray; Jacobus Swarts (Discret. Math., 2010)

The firefighter problem for cubic graphs. - Andrew D. King; Gary MacGillivray (Discret. Math., 2010)

The complexity of locally injective homomorphisms. - Gary MacGillivray; Jacobus Swarts (Discret. Math., 2010)

Structure of the set of all minimal total dominating functions of some classes of graphs. - K. Reji Kumar; Gary MacGillivray (Discuss. Math. Graph Theory, 2010)

Gray code numbers for graphs. - Kelly Choo; Gary MacGillivray (Ars Math. Contemp., 2011)

A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles. - Gary MacGillivray; Jacobus Swarts; Jørgen Bang-Jensen (Contributions Discret. Math., 2011)

The Ck-extended graft construction. - Gary MacGillivray; Jacobus Swarts (Discret. Appl. Math., 2011)

Obstructions to Injective Oriented Colourings. - Gary MacGillivray; André Raspaud; Jacobus Swarts (Electron. Notes Discret. Math., 2011)

The diameter of total domination and independent domination vertex-critical graphs. - Michelle Edwards; Gary MacGillivray (Australas. J Comb., 2012)

Characterizations of k-copwin graphs. - Nancy E. Clarke; Gary MacGillivray (Discret. Math., 2012)

Efficient domination in circulant graphs. - K. Reji Kumar; Gary MacGillivray (Discret. Math., 2013)

Weak near-unanimity functions and digraph homomorphism problems. - Gary MacGillivray; Jacobus Swarts (Theor. Comput. Sci., 2013)

A theory of 2-dipath colourings. - Gary MacGillivray; Kailyn M. Sherk (Australas. J Comb., 2014)

A simple method of computing the catch time. - Nancy E. Clarke; Stephen Finbow; Gary MacGillivray (Ars Math. Contemp., 2014)

Conditional Colourings with Given Template. - Peter Dukes; Steve Lowdon; Gary MacGillivray (Discret. Math. Theor. Comput. Sci., 2014)

Obstructions to locally injective oriented improper colourings. - Gary MacGillivray; André Raspaud; Jacobus Swarts (Eur. J. Comb., 2014)

Safe set problem on graphs. - Shinya Fujita 001; Gary MacGillivray; Tadashi Sakuma (Discret. Appl. Math., 2016)

Characterizations and algorithms for generalized Cops and Robbers games. - Anthony Bonato; Gary MacGillivray (Contributions Discret. Math., 2017)

Bounds for the $m$-Eternal Domination Number of a Graph. - Michael A. Henning; William Klostermeyer; Gary MacGillivray (Contributions Discret. Math., 2017)

Eternal domination: criticality and reachability. - William F. Klostermeyer; Gary MacGillivray (Discuss. Math. Graph Theory, 2017)

Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs. - Ruth Haas; Gary MacGillivray (Algorithms, 2018)

Perfect Roman domination in trees. - Michael A. Henning; William F. Klostermeyer; Gary MacGillivray (Discret. Appl. Math., 2018)

k-broadcast domination and k-multipacking. - Michael A. Henning; Gary MacGillivray; Frank Yang (Discret. Appl. Math., 2018)

Reconfiguring minimum dominating sets: the ?-graph of a tree. - Michelle Edwards; Gary MacGillivray; Shahla Nasserasr (Discuss. Math. Graph Theory, 2018)

Complexity of locally-injective homomorphisms to tournaments. - Stefan Bard; Thomas Bellitto; Christopher Duffy 001; Gary MacGillivray; Feiran Yang 003 (Discret. Math. Theor. Comput. Sci., 2018)

A Study of k-dipath Colourings of Oriented Graphs. - Christopher Duffy 001; Gary MacGillivray; Éric Sopena (Discret. Math. Theor. Comput. Sci., 2018)

Broadcast domination and multipacking in strongly chordal graphs. - Richard C. Brewster; Gary MacGillivray; Feiran Yang 003 (Discret. Appl. Math., 2019)

Oriented colourings of graphs with maximum degree three and four. - Christopher Duffy 001; Gary MacGillivray; Éric Sopena (Discret. Math., 2019)

Oriented incidence colourings of digraphs. - Christopher Duffy 001; Gary MacGillivray; Pascal Ochem; André Raspaud (Discuss. Math. Graph Theory, 2019)

The Firefighter problem: Saving sets of vertices on cubic graphs. - Christopher Duffy 001; Gary MacGillivray (Networks, 2019)

The firefighter problem on orientations of the cubic grid. - Gary MacGillivray; Shayla Redlin (Bull. ICA, 2020)

2-limited broadcast domination in subcubic graphs. - Michael A. Henning; Gary MacGillivray; Frank Yang (Discret. Appl. Math., 2020)

The 2-colouring problem for (m,n)-mixed graphs with switching is polynomial. - Richard C. Brewster; Arnott Kidner; Gary MacGillivray (Discret. Math. Theor. Comput. Sci., 2022)

Eternal domination and clique covering. - Gary MacGillivray; Christina M. Mynhardt; Virgélot Virgile (Electron. J. Graph Theory Appl., 2022)

A dichotomy theorem for Γ-switchable H-colouring on m-edge coloured graphs. - Richard C. Brewster; Arnott Kidner; Gary MacGillivray (CoRR, 2023)

Efficient (j, k)-dominating functions. - William Klostermeyer; Gary MacGillivray; Saeed Semnani; Farzaneh Piri (Discuss. Math. Graph Theory, 2023)

Homomorphically Full Oriented Graphs. - Thomas Bellitto; Christopher Duffy 001; Gary MacGillivray (Discret. Math. Theor. Comput. Sci., 2023)

Colourings of (m, n)-coloured mixed graphs. - Gary MacGillivray; Shahla Nasserasr; Feiran Yang 003 (Discret. Math. Theor. Comput. Sci., 2023)

Proving exact values for the 2-limited broadcast domination number on grid graphs. - Aaron Slobodin; Gary MacGillivray; Wendy J. Myrvold (Discret. Math. Theor. Comput. Sci., 2023)

2-limited broadcast domination on grid graphs. - Aaron Slobodin; Gary MacGillivray; Wendy J. Myrvold (Discret. Appl. Math., 2023)

Fractional eternal domination: securely distributing resources across a network. - Devvrit; Aaron Krim-Yee; Nithish Kumar; Gary MacGillivray; Ben Seamone; Virgélot Virgile; Anqi Xu (Discuss. Math. Graph Theory, 2024)

Lower boundary independent and hearing independent broadcasts in graphs. - Julia Hoepner; Gary MacGillivray; Christina M. Mynhardt (Discuss. Math. Graph Theory, 2025)

Switching m-edge-coloured graphs using non-abelian groups. - Christopher Duffy 001; Gary MacGillivray; Ben Tremblay (Australas. J Comb., 2025)