default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGary MacGillivray
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j79]Devvrit, Aaron Krim-Yee, Nithish Kumar, Gary MacGillivray
, Ben Seamone, Virgélot Virgile, Anqi Xu:
Fractional eternal domination: securely distributing resources across a network. Discuss. Math. Graph Theory 44(4): 1395-1428 (2024)- 2023
- [j78]Aaron Slobodin, Gary MacGillivray, Wendy J. Myrvold:
2-limited broadcast domination on grid graphs. Discret. Appl. Math. 338: 158-178 (2023) - [j77]William Klostermeyer, Gary MacGillivray, Saeed Semnani, Farzaneh Piri:
Efficient (j, k)-dominating functions. Discuss. Math. Graph Theory 43(1): 115-135 (2023) - [j76]Thomas Bellitto, Christopher Duffy, Gary MacGillivray:
Homomorphically Full Oriented Graphs. Discret. Math. Theor. Comput. Sci. 25(2) (2023) - [j75]Gary MacGillivray, Shahla Nasserasr, Feiran Yang:
Colourings of (m, n)-coloured mixed graphs. Discret. Math. Theor. Comput. Sci. 25(2) (2023) - [j74]Aaron Slobodin, Gary MacGillivray, Wendy J. Myrvold:
Proving exact values for the 2-limited broadcast domination number on grid graphs. Discret. Math. Theor. Comput. Sci. 25(2) (2023) - [i8]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 abs/2304.11795 (2023) - [i7]Richard C. Brewster, Arnott Kidner, Gary MacGillivray:
A dichotomy theorem for Γ-switchable H-colouring on m-edge coloured graphs. CoRR abs/2306.05962 (2023) - 2022
- [j73]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) - [j72]Gary MacGillivray, Christina M. Mynhardt, Virgélot Virgile:
Eternal domination and clique covering. Electron. J. Graph Theory Appl. 10(2): 603-624 (2022) - [i6]Thomas Bellitto, Christopher Duffy, Gary MacGillivray:
Homomorphically Full Oriented Graphs. CoRR abs/2208.10727 (2022) - 2021
- [i5]Gary MacGillivray, Christina M. Mynhardt, Virgélot Virgile:
Eternal Domination and Clique Covering. CoRR abs/2110.09732 (2021) - 2020
- [j71]Gary MacGillivray, Shayla Redlin:
The firefighter problem on orientations of the cubic grid. Bull. ICA 88: 22-29 (2020) - [j70]Michael A. Henning, Gary MacGillivray, Frank Yang:
2-limited broadcast domination in subcubic graphs. Discret. Appl. Math. 285: 691-706 (2020) - [i4]Gary MacGillivray, Shahla Nasserasr, Feiran Yang:
Colourings of (m, n)-coloured mixed graphs. CoRR abs/2010.09091 (2020)
2010 – 2019
- 2019
- [j69]Richard C. Brewster, Gary MacGillivray, Feiran Yang:
Broadcast domination and multipacking in strongly chordal graphs. Discret. Appl. Math. 261: 108-118 (2019) - [j68]Christopher Duffy, Gary MacGillivray, Éric Sopena:
Oriented colourings of graphs with maximum degree three and four. Discret. Math. 342(4): 959-974 (2019) - [j67]Christopher Duffy, Gary MacGillivray, Pascal Ochem, André Raspaud:
Oriented incidence colourings of digraphs. Discuss. Math. Graph Theory 39(1): 191-210 (2019) - [j66]Christopher Duffy, Gary MacGillivray:
The Firefighter problem: Saving sets of vertices on cubic graphs. Networks 74(1): 62-69 (2019) - 2018
- [j65]Ruth Haas, Gary MacGillivray:
Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs. Algorithms 11(4): 40 (2018) - [j64]Michael A. Henning, William F. Klostermeyer, Gary MacGillivray:
Perfect Roman domination in trees. Discret. Appl. Math. 236: 235-245 (2018) - [j63]Michael A. Henning, Gary MacGillivray, Frank Yang:
k-broadcast domination and k-multipacking. Discret. Appl. Math. 250: 241-251 (2018) - [j62]Michelle Edwards, Gary MacGillivray, Shahla Nasserasr:
Reconfiguring minimum dominating sets: the ?-graph of a tree. Discuss. Math. Graph Theory 38(3): 703-716 (2018) - [j61]Christopher Duffy, Gary MacGillivray, Éric Sopena:
A Study of k-dipath Colourings of Oriented Graphs. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j60]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) - [i3]Christopher Duffy, Gary MacGillivray, Éric Sopena:
Oriented Colourings of Graphs with Maximum Degree Three and Four. CoRR abs/1812.05510 (2018) - 2017
- [j59]Anthony Bonato, Gary MacGillivray:
Characterizations and algorithms for generalized Cops and Robbers games. Contributions Discret. Math. 12(1) (2017) - [j58]Michael A. Henning, William Klostermeyer, Gary MacGillivray:
Bounds for the $m$-Eternal Domination Number of a Graph. Contributions Discret. Math. 12(2) (2017) - [j57]William F. Klostermeyer, Gary MacGillivray:
Eternal domination: criticality and reachability. Discuss. Math. Graph Theory 37(1): 63-77 (2017) - [i2]Stefan Bard, Thomas Bellitto, Christopher Duffy, Gary MacGillivray, Feiran Yang:
Complexity of locally-injective homomorphisms to tournaments. CoRR abs/1710.08825 (2017) - 2016
- [j56]Shinya Fujita, Gary MacGillivray, Tadashi Sakuma:
Safe set problem on graphs. Discret. Appl. Math. 215: 106-111 (2016) - [i1]Christopher Duffy, Gary MacGillivray, Éric Sopena:
A Study of $k$-dipath Colourings of Oriented Graphs. CoRR abs/1605.08905 (2016) - 2014
- [j55]Gary MacGillivray, Kailyn M. Sherk:
A theory of 2-dipath colourings. Australas. J Comb. 60: 11-26 (2014) - [j54]Nancy E. Clarke, Stephen Finbow, Gary MacGillivray:
A simple method of computing the catch time. Ars Math. Contemp. 7(2): 353-359 (2014) - [j53]Peter Dukes, Steve Lowdon, Gary MacGillivray:
Conditional Colourings with Given Template. Discret. Math. Theor. Comput. Sci. 16(3): 61-76 (2014) - [j52]Gary MacGillivray, André Raspaud, Jacobus Swarts:
Obstructions to locally injective oriented improper colourings. Eur. J. Comb. 35: 402-412 (2014) - 2013
- [j51]K. Reji Kumar, Gary MacGillivray:
Efficient domination in circulant graphs. Discret. Math. 313(6): 767-771 (2013) - [j50]Gary MacGillivray, Jacobus Swarts:
Weak near-unanimity functions and digraph homomorphism problems. Theor. Comput. Sci. 477: 32-47 (2013) - 2012
- [j49]Michelle Edwards, Gary MacGillivray:
The diameter of total domination and independent domination vertex-critical graphs. Australas. J Comb. 52: 33-40 (2012) - [j48]Nancy E. Clarke, Gary MacGillivray:
Characterizations of k-copwin graphs. Discret. Math. 312(8): 1421-1425 (2012) - 2011
- [j47]Kelly Choo, Gary MacGillivray:
Gray code numbers for graphs. Ars Math. Contemp. 4(1): 125-139 (2011) - [j46]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) - [j45]Gary MacGillivray, Jacobus Swarts:
The Ck-extended graft construction. Discret. Appl. Math. 159(12): 1293-1301 (2011) - [j44]Gary MacGillivray, André Raspaud, Jacobus Swarts:
Obstructions to Injective Oriented Colourings. Electron. Notes Discret. Math. 38: 597-605 (2011) - 2010
- [j43]Andrew D. King, Gary MacGillivray:
The firefighter problem for cubic graphs. Discret. Math. 310(3): 614-621 (2010) - [j42]Jørgen Bang-Jensen, Gary MacGillivray, Jacobus Swarts:
The complexity of colouring by locally semicomplete digraphs. Discret. Math. 310(20): 2675-2684 (2010) - [j41]Gary MacGillivray, Jacobus Swarts:
The complexity of locally injective homomorphisms. Discret. Math. 310(20): 2685-2696 (2010) - [j40]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): 407-423 (2010)
2000 – 2009
- 2009
- [j39]Stephen Finbow, Gary MacGillivray:
The Firefighter Problem: a survey of results, directions and questions. Australas. J Comb. 43: 57-78 (2009) - [j38]Gary MacGillivray, Mark H. Siggers:
On the complexity of H-colouring planar graphs. Discret. Math. 309(18): 5729-5738 (2009) - [j37]Richard C. Brewster, Gary MacGillivray, Laura Shepherd:
The circular chromatic number of hypergraphs. Discret. Math. 309(18): 5757-5765 (2009) - [c1]Gary MacGillivray, André Raspaud, Jacobus Swarts:
Injective Oriented Colourings. WG 2009: 262-272 - 2008
- [j36]K. Reji Kumar, S. Arumugam, Gary MacGillivray:
On Maximal Fractional Independent Sets In Graphs. Ars Comb. 87 (2008) - [j35]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): 938-960 (2008) - 2007
- [j34]Peter Dukes, Gary MacGillivray, Kristen Parton:
Bounds on the achromatic number of partial triple systems. Contributions Discret. Math. 2(1) (2007) - [j33]Stephen Finbow, Andrew D. King, Gary MacGillivray, Romeo Rizzi:
The firefighter problem for graphs of maximum degree three. Discret. Math. 307(16): 2094-2105 (2007) - 2006
- [j32]Richard C. Brewster, Gary MacGillivray:
Building blocks for the variety of absolute retracts. Discret. Math. 306(15): 1758-1764 (2006) - [j31]Gena Hahn, Gary MacGillivray:
A note on k-cop, l-robber games on graphs. Discret. Math. 306(19-20): 2492-2497 (2006) - 2005
- [j30]Shannon L. Fitzpatrick, Gary MacGillivray:
Non 3-Choosable Bipartite Graphs and The Fano Plane. Ars Comb. 76 (2005) - 2004
- [j29]William Klostermeyer, Gary MacGillivray:
Homomorphisms and oriented colorings of equivalence classes of oriented graphs. Discret. Math. 274(1-3): 161-172 (2004) - [j28]William Klostermeyer, Gary MacGillivray:
Analogues of cliques for oriented coloring. Discuss. Math. Graph Theory 24(3): 373-387 (2004) - 2003
- [j27]Ruth Haas, Denis Hanson, Gary MacGillivray:
Bounds For Partial List Colourings. Ars Comb. 67 (2003) - 2002
- [j26]Jing Huang, Gary MacGillivray, Anders Yeo:
Pushing vertices in digraphs without long induced cycles. Discret. Appl. Math. 121(1-3): 181-192 (2002) - [j25]Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary MacGillivray:
Star forests, dominating sets and Ramsey-type problems. Discret. Math. 245(1-3): 255-262 (2002) - [j24]Shannon L. Fitzpatrick, Gary MacGillivray, Devon McCrea:
Total domination in complements of graphs containing no K4, 4. Discret. Math. 254(1-3): 143-151 (2002) - 2001
- [j23]Gary MacGillivray, Karen Seyffarth:
Classes of line graphs with small cycle double covers. Australas. J Comb. 24: 91-114 (2001) - [j22]Richard C. Brewster, Gary MacGillivray:
Minimizing b + D and well covered graphs. Ars Comb. 61 (2001) - [j21]Jing Huang, Gary MacGillivray, Kathryn L. B. Wood:
Pushing the cycles out of multipartite tournaments. Discret. Math. 231(1-3): 279-287 (2001) - [j20]Gary MacGillivray, A. Rodriguez:
The achromatic number of the union of paths. Discret. Math. 231(1-3): 331-335 (2001) - 2000
- [j19]Gary MacGillivray, Kathryn L. B. Wood:
Re-Orienting Tournaments by Pushing Vertices. Ars Comb. 57 (2000) - [j18]Ernest J. Cockayne, Gary MacGillivray, Jill Simmons:
CO-irredundant Ramsey numbers for graphs. J. Graph Theory 34(4): 258-268 (2000)
1990 – 1999
- 1997
- [j17]Richard C. Brewster, Pavol Hell, Gary MacGillivray:
The complexity of restricted graph homomorphisms. Discret. Math. 167-168: 145-154 (1997) - 1996
- [j16]Denis Hanson, Gary MacGillivray, Bjarne Toft:
Choosability of bipartite graphs. Ars Comb. 44 (1996) - [j15]Richard C. Brewster, Gary MacGillivray:
Homomorphically Full Graphs. Discret. Appl. Math. 66(1): 23-31 (1996) - [j14]S. Ao, Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt:
Domination critical graphs with higher independent domination numbers. J. Graph Theory 22(1): 9-14 (1996) - [j13]Gary MacGillivray, Karen Seyffarth:
Domination numbers of planar graphs. J. Graph Theory 22(3): 213-229 (1996) - 1995
- [j12]Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray:
Hereditarily hard H-colouring problems. Discret. Math. 138(1-3): 75-92 (1995) - [j11]Jason Fulman, Denis Hanson, Gary MacGillivray:
Vertex domination-critical graphs. Networks 25(2): 41-43 (1995) - 1994
- [j10]Gary MacGillivray:
Graph Homomorphisms with Infinite Targets. Discret. Appl. Math. 54(1): 29-35 (1994) - [j9]Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt:
Convexity of minimal dominating functions of trees - II. Discret. Math. 125(1-3): 137-146 (1994) - [j8]Denis Hanson, Ping Wang, Gary MacGillivray:
A note on minimum graphs with girth pair (4, 2l + 1). J. Graph Theory 18(4): 325-327 (1994) - 1993
- [j7]Denis Hanson, Gary MacGillivray, Dale Youngs:
The size of a minimum five-chromatic K4-free graph. Discret. Math. 122(1-3): 353-355 (1993) - 1992
- [j6]Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray:
On the complexity of colouring by superdigraphs of bipartite graphs. Discret. Math. 109(1-3): 27-44 (1992) - 1991
- [j5]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): 313-317 (1991) - [j4]Richard C. Brewster, Gary MacGillivray:
A Note on Restricted H-Colouring. Inf. Process. Lett. 40(3): 149-151 (1991) - [j3]Gary MacGillivray:
On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs. SIAM J. Discret. Math. 4(3): 397-408 (1991)
1980 – 1989
- 1989
- [j2]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
- [j1]Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray:
The Complexity of Colouring by Semicomplete Digraphs. SIAM J. Discret. Math. 1(3): 281-298 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-18 00:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
