Gary MacGillivray

Publication Activity (10 Years)

Years Active: 1988-2023
Publications (10 Years): 28

Top Topics

Data Broadcasting

Graph Theoretic

Face Centered Cubic

Top Venues

Discret. Appl. Math.

Discret. Math. Theor. Comput. Sci.

Discuss. Math. Graph Theory

Publications

Aaron Slobodin, Gary MacGillivray, Wendy J. Myrvold
2-limited broadcast domination on grid graphs. Discret. Appl. Math. 338 (2023)
William Klostermeyer, Gary MacGillivray, Saeed Semnani, Farzaneh Piri
Efficient (j, k)-dominating functions. Discuss. Math. Graph Theory 43 (1) (2023)
Richard C. Brewster, Arnott Kidner, Gary MacGillivray
A dichotomy theorem for Γ-switchable H-colouring on m-edge coloured graphs. CoRR (2023)
Devvrit, Aaron Krim-Yee, Nithish Kumar, Gary MacGillivray, Ben Seamone, Virgélot Virgile, Anqi Xu
Fractional eternal domination: securely distributing resources across a network. CoRR (2023)
Richard C. Brewster, Arnott Kidner, Gary MacGillivray
The 2-colouring problem for $(m, n)$-mixed graphs with switching is polynomial. Discret. Math. Theor. Comput. Sci. 24 (2) (2022)
Gary MacGillivray, Christina M. Mynhardt, Virgélot Virgile
Eternal domination and clique covering. Electron. J. Graph Theory Appl. 10 (2) (2022)
Thomas Bellitto, Christopher Duffy, Gary MacGillivray
Homomorphically Full Oriented Graphs. CoRR (2022)
Gary MacGillivray, Christina M. Mynhardt, Virgélot Virgile
Eternal Domination and Clique Covering. CoRR (2021)
Michael A. Henning, Gary MacGillivray, Frank Yang
2-limited broadcast domination in subcubic graphs. Discret. Appl. Math. 285 (2020)
Gary MacGillivray, Shayla Redlin
The firefighter problem on orientations of the cubic grid. Bull. ICA 88 (2020)
Gary MacGillivray, Shahla Nasserasr, Feiran Yang
Colourings of (m, n)-coloured mixed graphs. CoRR (2020)
Christopher Duffy, Gary MacGillivray, Éric Sopena
Oriented colourings of graphs with maximum degree three and four. Discret. Math. 342 (4) (2019)
Richard C. Brewster, Gary MacGillivray, Feiran Yang
Broadcast domination and multipacking in strongly chordal graphs. Discret. Appl. Math. 261 (2019)
Christopher Duffy, Gary MacGillivray
The Firefighter problem: Saving sets of vertices on cubic graphs. Networks 74 (1) (2019)
Christopher Duffy, Gary MacGillivray, Pascal Ochem, André Raspaud
Oriented incidence colourings of digraphs. Discuss. Math. Graph Theory 39 (1) (2019)
Stefan Bard, Thomas Bellitto, Christopher Duffy, Gary MacGillivray, Feiran Yang
Complexity of locally-injective homomorphisms to tournaments. Discret. Math. Theor. Comput. Sci. 20 (2) (2018)
Michael A. Henning, Gary MacGillivray, Frank Yang
k-broadcast domination and k-multipacking. Discret. Appl. Math. 250 (2018)
Michelle Edwards, Gary MacGillivray, Shahla Nasserasr
-graph of a tree. Discuss. Math. Graph Theory 38 (3) (2018)
Ruth Haas, Gary MacGillivray
Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs. Algorithms 11 (4) (2018)
Christopher Duffy, Gary MacGillivray, Éric Sopena
A Study of k-dipath Colourings of Oriented Graphs. Discret. Math. Theor. Comput. Sci. 20 (1) (2018)
Christopher Duffy, Gary MacGillivray, Éric Sopena
Oriented Colourings of Graphs with Maximum Degree Three and Four. CoRR (2018)
Michael A. Henning, William F. Klostermeyer, Gary MacGillivray
Perfect Roman domination in trees. Discret. Appl. Math. 236 (2018)
Stefan Bard, Thomas Bellitto, Christopher Duffy, Gary MacGillivray, Feiran Yang
Complexity of locally-injective homomorphisms to tournaments. CoRR (2017)
Anthony Bonato, Gary MacGillivray
Characterizations and algorithms for generalized Cops and Robbers games. Contributions Discret. Math. 12 (1) (2017)
William F. Klostermeyer, Gary MacGillivray
Eternal domination: criticality and reachability. Discuss. Math. Graph Theory 37 (1) (2017)
Michael A. Henning, William Klostermeyer, Gary MacGillivray
Bounds for the $m$-Eternal Domination Number of a Graph. Contributions Discret. Math. 12 (2) (2017)
Christopher Duffy, Gary MacGillivray, Éric Sopena
A Study of $k$-dipath Colourings of Oriented Graphs. CoRR (2016)
Shinya Fujita, Gary MacGillivray, Tadashi Sakuma
Safe set problem on graphs. Discret. Appl. Math. 215 (2016)
Gary MacGillivray, Kailyn M. Sherk
A theory of 2-dipath colourings. Australas. J Comb. 60 (2014)
Gary MacGillivray, André Raspaud, Jacobus Swarts
Obstructions to locally injective oriented improper colourings. Eur. J. Comb. 35 (2014)
Peter Dukes, Steve Lowdon, Gary MacGillivray
Conditional Colourings with Given Template. Discret. Math. Theor. Comput. Sci. 16 (3) (2014)
Nancy E. Clarke, Stephen Finbow, Gary MacGillivray
A simple method of computing the catch time. Ars Math. Contemp. 7 (2) (2014)
Gary MacGillivray, Jacobus Swarts
Weak near-unanimity functions and digraph homomorphism problems. Theor. Comput. Sci. 477 (2013)
K. Reji Kumar, Gary MacGillivray
Efficient domination in circulant graphs. Discret. Math. 313 (6) (2013)
Michelle Edwards, Gary MacGillivray
The diameter of total domination and independent domination vertex-critical graphs. Australas. J Comb. 52 (2012)
Nancy E. Clarke, Gary MacGillivray
Characterizations of k-copwin graphs. Discret. Math. 312 (8) (2012)
Gary MacGillivray, Jacobus Swarts
-extended graft construction. Discret. Appl. Math. 159 (12) (2011)
Kelly Choo, Gary MacGillivray
Gray code numbers for graphs. Ars Math. Contemp. 4 (1) (2011)
Gary MacGillivray, Jacobus Swarts, Jørgen Bang-Jensen
A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles. Contributions Discret. Math. 6 (2) (2011)
Gary MacGillivray, André Raspaud, Jacobus Swarts
Obstructions to Injective Oriented Colourings. Electron. Notes Discret. Math. 38 (2011)
K. Reji Kumar, Gary MacGillivray
Structure of the set of all minimal total dominating functions of some classes of graphs. Discuss. Math. Graph Theory 30 (3) (2010)
Jørgen Bang-Jensen, Gary MacGillivray, Jacobus Swarts
The complexity of colouring by locally semicomplete digraphs. Discret. Math. 310 (20) (2010)
Gary MacGillivray, Jacobus Swarts
The complexity of locally injective homomorphisms. Discret. Math. 310 (20) (2010)
Andrew D. King, Gary MacGillivray
The firefighter problem for cubic graphs. Discret. Math. 310 (3) (2010)
Gary MacGillivray, André Raspaud, Jacobus Swarts
Injective Oriented Colourings. WG (2009)
Gary MacGillivray, Mark H. Siggers
On the complexity of H-colouring planar graphs. Discret. Math. 309 (18) (2009)
Richard C. Brewster, Gary MacGillivray, Laura Shepherd
The circular chromatic number of hypergraphs. Discret. Math. 309 (18) (2009)
Stephen Finbow, Gary MacGillivray
The Firefighter Problem: a survey of results, directions and questions. Australas. J Comb. 43 (2009)
Richard C. Brewster, Tomás Feder, Pavol Hell, Jing Huang, Gary MacGillivray
Near-Unanimity Functions and Varieties of Reflexive Graphs. SIAM J. Discret. Math. 22 (3) (2008)
K. Reji Kumar, S. Arumugam, Gary MacGillivray
On Maximal Fractional Independent Sets In Graphs. Ars Comb. 87 (2008)
Peter Dukes, Gary MacGillivray, Kristen Parton
Bounds on the achromatic number of partial triple systems. Contributions Discret. Math. 2 (1) (2007)
Stephen Finbow, Andrew D. King, Gary MacGillivray, Romeo Rizzi
The firefighter problem for graphs of maximum degree three. Discret. Math. 307 (16) (2007)
Gena Hahn, Gary MacGillivray
A note on k-cop, l-robber games on graphs. Discret. Math. 306 (19-20) (2006)
Richard C. Brewster, Gary MacGillivray
Building blocks for the variety of absolute retracts. Discret. Math. 306 (15) (2006)
Shannon L. Fitzpatrick, Gary MacGillivray
Non 3-Choosable Bipartite Graphs and The Fano Plane. Ars Comb. 76 (2005)
William Klostermeyer, Gary MacGillivray
Homomorphisms and oriented colorings of equivalence classes of oriented graphs. Discret. Math. 274 (1-3) (2004)
William Klostermeyer, Gary MacGillivray
Analogues of cliques for oriented coloring. Discuss. Math. Graph Theory 24 (3) (2004)
Ruth Haas, Denis Hanson, Gary MacGillivray
Bounds For Partial List Colourings. Ars Comb. 67 (2003)
Shannon L. Fitzpatrick, Gary MacGillivray, Devon McCrea
. Discret. Math. 254 (1-3) (2002)
Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary MacGillivray
Star forests, dominating sets and Ramsey-type problems. Discret. Math. 245 (1-3) (2002)
Jing Huang, Gary MacGillivray, Anders Yeo
Pushing vertices in digraphs without long induced cycles. Discret. Appl. Math. 121 (1-3) (2002)
Gary MacGillivray, A. Rodriguez
The achromatic number of the union of paths. Discret. Math. 231 (1-3) (2001)
Richard C. Brewster, Gary MacGillivray
Minimizing b + D and well covered graphs. Ars Comb. 61 (2001)
Jing Huang, Gary MacGillivray, Kathryn L. B. Wood
Pushing the cycles out of multipartite tournaments. Discret. Math. 231 (1-3) (2001)
Gary MacGillivray, Karen Seyffarth
Classes of line graphs with small cycle double covers. Australas. J Comb. 24 (2001)
Gary MacGillivray, Kathryn L. B. Wood
Re-Orienting Tournaments by Pushing Vertices. Ars Comb. 57 (2000)
Ernest J. Cockayne, Gary MacGillivray, Jill Simmons
CO-irredundant Ramsey numbers for graphs. J. Graph Theory 34 (4) (2000)
Richard C. Brewster, Pavol Hell, Gary MacGillivray
The complexity of restricted graph homomorphisms. Discret. Math. (1997)
Gary MacGillivray, Karen Seyffarth
Domination numbers of planar graphs. J. Graph Theory 22 (3) (1996)
S. Ao, Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt
Domination critical graphs with higher independent domination numbers. J. Graph Theory 22 (1) (1996)
Richard C. Brewster, Gary MacGillivray
Homomorphically Full Graphs. Discret. Appl. Math. 66 (1) (1996)
Denis Hanson, Gary MacGillivray, Bjarne Toft
Choosability of bipartite graphs. Ars Comb. 44 (1996)
Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray
Hereditarily hard H-colouring problems. Discret. Math. 138 (1-3) (1995)
Jason Fulman, Denis Hanson, Gary MacGillivray
Vertex domination-critical graphs. Networks 25 (2) (1995)
Gary MacGillivray
Graph Homomorphisms with Infinite Targets. Discret. Appl. Math. 54 (1) (1994)
Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt
Convexity of minimal dominating functions of trees - II. Discret. Math. 125 (1-3) (1994)
Denis Hanson, Ping Wang, Gary MacGillivray
+ 1). J. Graph Theory 18 (4) (1994)
Denis Hanson, Gary MacGillivray, Dale Youngs
-free graph. Discret. Math. 122 (1-3) (1993)
Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray
On the complexity of colouring by superdigraphs of bipartite graphs. Discret. Math. 109 (1-3) (1992)
Ernest J. Cockayne, Odile Favaron, Hao Li, Gary MacGillivray
The product of the independent domination numbers of a graph and its complement. Discret. Math. 90 (3) (1991)
Gary MacGillivray
On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs. SIAM J. Discret. Math. 4 (3) (1991)
Richard C. Brewster, Gary MacGillivray
A Note on Restricted H-Colouring. Inf. Process. Lett. 40 (3) (1991)
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) (1989)
Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray
The Complexity of Colouring by Semicomplete Digraphs. SIAM J. Discret. Math. 1 (3) (1988)