Maneuver number in eternal domination.

Gary MacGillivray

Richard C. Brewster Gary MacGillivray Ethan Williams Maneuver number in eternal domination. 2026 5-14 391 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2026.04.025 db/journals/dam/dam391.html#BrewsterMW26 streams/journals/dam

Stefan Bard Gary MacGillivray Jacobus Swarts The complexity of frugal digraph homomorphisms. 2026 May abs/2605.24258 CoRR https://doi.org/10.48550/arXiv.2605.24258 db/journals/corr/corr2605.html#abs-2605-24258 streams/journals/corr

Christopher Duffy 0001 Gary MacGillivray Ben Tremblay Switching m-edge-coloured graphs using non-abelian groups. 20-31 2025 February 91 Australas. J Comb. http://ajc.maths.uq.edu.au/pdf/91/ajc_v91_p020.pdf db/journals/ajc/ajc91.html#DuffyMT25 streams/journals/ajc

Aaron Slobodin Wendy J. Myrvold Gary MacGillivray Patrick W. Fowler Tight upper bounds for the p-anionic Clar number of fullerenes. 2025 1 26 Ars Math. Contemp. 1 https://doi.org/10.26493/1855-3974.3282.6ea db/journals/arsmc/arsmc26.html#SlobodinMMF25 streams/journals/arsmc

Julia Hoepner Gary MacGillivray Christina M. Mynhardt Lower boundary independent and hearing independent broadcasts in graphs. 653-675 2025 45 Discuss. Math. Graph Theory 2 https://doi.org/10.7151/dmgt.2546 db/journals/dmgt/dmgt45.html#HoepnerMM25

Julia Hoepner Gary MacGillivray Christina M. Mynhardt Maximum boundary independent broadcasts in graphs and trees. 231-249 2025 13 Electron. J. Graph Theory Appl. 2 https://doi.org/10.5614/ejgta.2025.13.2.1 db/journals/ejgta/ejgta13.html#HoepnerMM25 streams/journals/ejgta

Richard C. Brewster Arnott Kidner Gary MacGillivray A Dichotomy Theorem for Γ-Switchable H-Colouring on m-Edge-Coloured Graphs. 200-208 2025 110 J. Graph Theory 2 https://doi.org/10.1002/jgt.23265 db/journals/jgt/jgt110.html#BrewsterKM25 streams/journals/jgt

Bruno Amezcua-Osorio César Hernández-Cruz Seyyed Aliasghar Hosseini Humberto Lozano-Chávez Gary MacGillivray Cops and Robbers on Token Graphs. 493-500 2025 LAGOS https://doi.org/10.1016/j.procs.2025.10.337 conf/lagos/2025 db/conf/lagos/lagos2025.html#Amezcua-OsorioH25

Devvrit Aaron Krim-Yee Nithish Kumar Gary MacGillivray Ben Seamone Virgélot Virgile Anqi Xu Fractional eternal domination: securely distributing resources across a network. 1395-1428 2024 44 Discuss. Math. Graph Theory 4 https://doi.org/10.7151/dmgt.2503 db/journals/dmgt/dmgt44.html#DevvritKKMSVX24

Aaron Slobodin Gary MacGillivray Wendy J. Myrvold 2-limited broadcast domination on grid graphs. 158-178 2023 October 338 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2023.05.031 db/journals/dam/dam338.html#SlobodinMM23

William Klostermeyer Gary MacGillivray Saeed Semnani Farzaneh Piri Efficient (j, k)-dominating functions. 115-135 2023 43 Discuss. Math. Graph Theory 1 https://doi.org/10.7151/dmgt.2355 db/journals/dmgt/dmgt43.html#KlostermeyerMSP23

Thomas Bellitto Christopher Duffy 0001 Gary MacGillivray Homomorphically Full Oriented Graphs. 2023 25 Discret. Math. Theor. Comput. Sci. 2 https://doi.org/10.46298/dmtcs.9957 db/journals/dmtcs/dmtcs25.html#Bellitto0M23

Gary MacGillivray Shahla Nasserasr Feiran Yang 0003 Colourings of (m, n)-coloured mixed graphs. 2023 25 Discret. Math. Theor. Comput. Sci. 2 https://doi.org/10.46298/dmtcs.6848 db/journals/dmtcs/dmtcs25.html#MacGillivrayN023

Aaron Slobodin Gary MacGillivray Wendy J. Myrvold Proving exact values for the 2-limited broadcast domination number on grid graphs. 2023 25 Discret. Math. Theor. Comput. Sci. 2 https://doi.org/10.46298/dmtcs.11478 db/journals/dmtcs/dmtcs25.html#SlobodinMM23

Devvrit Aaron Krim-Yee Nithish Kumar Gary MacGillivray Ben Seamone Virgélot Virgile Anqi Xu Fractional eternal domination: securely distributing resources across a network. 2023 abs/2304.11795 CoRR https://doi.org/10.48550/arXiv.2304.11795 db/journals/corr/corr2304.html#abs-2304-11795

Richard C. Brewster Arnott Kidner Gary MacGillivray A dichotomy theorem for Γ-switchable H-colouring on m-edge coloured graphs. 2023 abs/2306.05962 CoRR https://doi.org/10.48550/arXiv.2306.05962 db/journals/corr/corr2306.html#abs-2306-05962

Richard C. Brewster Arnott Kidner Gary MacGillivray The 2-colouring problem for (m,n)-mixed graphs with switching is polynomial. 2022 24 Discret. Math. Theor. Comput. Sci. 2 https://doi.org/10.46298/dmtcs.9242 db/journals/dmtcs/dmtcs24.html#BrewsterKM22

Gary MacGillivray Christina M. Mynhardt Virgélot Virgile Eternal domination and clique covering. 603-624 2022 10 Electron. J. Graph Theory Appl. 2 https://doi.org/10.5614/ejgta.2022.10.2.19 db/journals/ejgta/ejgta10.html#MacGillivrayMV22

Thomas Bellitto Christopher Duffy 0001 Gary MacGillivray Homomorphically Full Oriented Graphs. 2022 abs/2208.10727 CoRR https://doi.org/10.48550/arXiv.2208.10727 db/journals/corr/corr2208.html#abs-2208-10727

Gary MacGillivray Christina M. Mynhardt Virgélot Virgile Eternal Domination and Clique Covering. 2021 abs/2110.09732 CoRR https://arxiv.org/abs/2110.09732 db/journals/corr/corr2110.html#abs-2110-09732

Gary MacGillivray Shayla Redlin The firefighter problem on orientations of the cubic grid. 22-29 2020 88 Bull. ICA db/journals/bullica/bullica88.html#MacGillivrayR20 https://luca-giuzzi.unibs.it/ICA/Volumes/88/Reprints/BICA2018-15-Reprint.pdf

Michael A. Henning Gary MacGillivray Frank Yang 2-limited broadcast domination in subcubic graphs. 691-706 2020 285 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2020.07.010 db/journals/dam/dam285.html#HenningMY20

Gary MacGillivray Shahla Nasserasr Feiran Yang 0003 Colourings of (m, n)-coloured mixed graphs. 2020 abs/2010.09091 CoRR https://arxiv.org/abs/2010.09091 db/journals/corr/corr2010.html#abs-2010-09091

Richard C. Brewster Gary MacGillivray Feiran Yang 0003 Broadcast domination and multipacking in strongly chordal graphs. 108-118 2019 261 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2018.08.021 db/journals/dam/dam261.html#BrewsterMY19

Christopher Duffy 0001 Gary MacGillivray Éric Sopena Oriented colourings of graphs with maximum degree three and four. 959-974 2019 342 Discret. Math. 4 https://doi.org/10.1016/j.disc.2018.10.008 db/journals/dm/dm342.html#DuffyMS19

Christopher Duffy 0001 Gary MacGillivray Pascal Ochem André Raspaud Oriented incidence colourings of digraphs. 191-210 2019 39 Discuss. Math. Graph Theory 1 https://doi.org/10.7151/dmgt.2076 https://www.wikidata.org/entity/Q129949336 db/journals/dmgt/dmgt39.html#DuffyMOR19

Christopher Duffy 0001 Gary MacGillivray The Firefighter problem: Saving sets of vertices on cubic graphs. 62-69 2019 74 Networks 1 https://doi.org/10.1002/net.21873 https://www.wikidata.org/entity/Q128359421 db/journals/networks/networks74.html#DuffyM19

Ruth Haas Gary MacGillivray Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs. 40 2018 11 Algorithms 4 https://doi.org/10.3390/a11040040 https://www.wikidata.org/entity/Q130047657 db/journals/algorithms/algorithms11.html#HaasM18

Michael A. Henning William F. Klostermeyer Gary MacGillivray Perfect Roman domination in trees. 235-245 2018 236 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2017.10.027 db/journals/dam/dam236.html#HenningKM18

Michael A. Henning Gary MacGillivray Frank Yang k-broadcast domination and k-multipacking. 241-251 2018 250 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2018.04.022 db/journals/dam/dam250.html#HenningMY18

Michelle Edwards Gary MacGillivray Shahla Nasserasr Reconfiguring minimum dominating sets: the ?-graph of a tree. 703-716 2018 38 Discuss. Math. Graph Theory 3 https://doi.org/10.7151/dmgt.2044 db/journals/dmgt/dmgt38.html#EdwardsMN18

Christopher Duffy 0001 Gary MacGillivray Éric Sopena A Study of k-dipath Colourings of Oriented Graphs. 2018 20 Discret. Math. Theor. Comput. Sci. 1 https://doi.org/10.23638/DMTCS-20-1-6 db/journals/dmtcs/dmtcs20.html#DuffyMS18

Stefan Bard Thomas Bellitto Christopher Duffy 0001 Gary MacGillivray Feiran Yang 0003 Complexity of locally-injective homomorphisms to tournaments. 2018 20 Discret. Math. Theor. Comput. Sci. 2 https://doi.org/10.23638/DMTCS-20-2-4 db/journals/dmtcs/dmtcs20.html#BardBDMY18

Christopher Duffy 0001 Gary MacGillivray Éric Sopena Oriented Colourings of Graphs with Maximum Degree Three and Four. 2018 abs/1812.05510 CoRR http://arxiv.org/abs/1812.05510 db/journals/corr/corr1812.html#abs-1812-05510

Anthony Bonato Gary MacGillivray Characterizations and algorithms for generalized Cops and Robbers games. 2017 12 Contributions Discret. Math. 1 https://doi.org/10.11575/cdm.v12i1.62435 db/journals/cdm/cdm12.html#BonatoM17

Michael A. Henning William Klostermeyer Gary MacGillivray Bounds for the $m$-Eternal Domination Number of a Graph. 2017 12 Contributions Discret. Math. 2 https://doi.org/10.11575/cdm.v12i2.62550 db/journals/cdm/cdm12.html#HenningKM17

William F. Klostermeyer Gary MacGillivray Eternal domination: criticality and reachability. 63-77 2017 37 Discuss. Math. Graph Theory 1 https://doi.org/10.7151/dmgt.1918 db/journals/dmgt/dmgt37.html#KlostermeyerM17

Stefan Bard Thomas Bellitto Christopher Duffy 0001 Gary MacGillivray Feiran Yang 0003 Complexity of locally-injective homomorphisms to tournaments. 2017 abs/1710.08825 CoRR http://arxiv.org/abs/1710.08825 db/journals/corr/corr1710.html#abs-1710-08825

Shinya Fujita 0001 Gary MacGillivray Tadashi Sakuma Safe set problem on graphs. 106-111 2016 215 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2016.07.020 db/journals/dam/dam215.html#FujitaMS16

Christopher Duffy 0001 Gary MacGillivray Éric Sopena A Study of $k$-dipath Colourings of Oriented Graphs. 2016 abs/1605.08905 CoRR http://arxiv.org/abs/1605.08905 db/journals/corr/corr1605.html#DuffyMS16

Gary MacGillivray Kailyn M. Sherk A theory of 2-dipath colourings. 11-26 2014 60 Australas. J Comb. http://ajc.maths.uq.edu.au/pdf/60/ajc_v60_p011.pdf db/journals/ajc/ajc60.html#MacGillivrayS14

Nancy E. Clarke Stephen Finbow Gary MacGillivray A simple method of computing the catch time. 353-359 2014 7 Ars Math. Contemp. 2 https://doi.org/10.26493/1855-3974.304.fec https://www.wikidata.org/entity/Q129355460 db/journals/arsmc/arsmc7.html#ClarkeFM14

Peter Dukes Steve Lowdon Gary MacGillivray Conditional Colourings with Given Template. 61-76 2014 16 Discret. Math. Theor. Comput. Sci. 3 https://doi.org/10.46298/dmtcs.2092 db/journals/dmtcs/dmtcs16.html#DukesLM14

Gary MacGillivray André Raspaud Jacobus Swarts Obstructions to locally injective oriented improper colourings. 402-412 2014 35 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2013.06.023 https://www.wikidata.org/entity/Q114184812 db/journals/ejc/ejc35.html#MacGillivrayRS14

K. Reji Kumar Gary MacGillivray Efficient domination in circulant graphs. 767-771 2013 313 Discret. Math. 6 https://doi.org/10.1016/j.disc.2012.12.003 db/journals/dm/dm313.html#KumarM13

Gary MacGillivray Jacobus Swarts Weak near-unanimity functions and digraph homomorphism problems. 32-47 2013 477 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2012.12.025 db/journals/tcs/tcs477.html#MacGillivrayS13

Michelle Edwards Gary MacGillivray The diameter of total domination and independent domination vertex-critical graphs. 33-40 2012 52 Australas. J Comb. http://ajc.maths.uq.edu.au/pdf/52/ajc_v52_p033.pdf db/journals/ajc/ajc52.html#EdwardsM12

Nancy E. Clarke Gary MacGillivray Characterizations of k-copwin graphs. 1421-1425 2012 312 Discret. Math. 8 https://doi.org/10.1016/j.disc.2012.01.002 db/journals/dm/dm312.html#ClarkeM12

Kelly Choo Gary MacGillivray Gray code numbers for graphs. 125-139 2011 4 Ars Math. Contemp. 1 https://doi.org/10.26493/1855-3974.196.0df https://www.wikidata.org/entity/Q129352733 db/journals/arsmc/arsmc4.html#ChooM11

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. 2011 6 Contributions Discret. Math. 2 https://doi.org/10.11575/cdm.v6i2.62095 db/journals/cdm/cdm6.html#MacGillivraySB11

Gary MacGillivray Jacobus Swarts The Ck-extended graft construction. 1293-1301 2011 159 Discret. Appl. Math. 12 https://doi.org/10.1016/j.dam.2011.04.006 db/journals/dam/dam159.html#MacGillivrayS11

Gary MacGillivray André Raspaud Jacobus Swarts Obstructions to Injective Oriented Colourings. 597-605 2011 38 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2011.10.001 https://www.wikidata.org/entity/Q114183691 db/journals/endm/endm38.html#MacGillivrayRS11

Andrew D. King Gary MacGillivray The firefighter problem for cubic graphs. 614-621 2010 310 Discret. Math. 3 https://doi.org/10.1016/j.disc.2009.05.007 db/journals/dm/dm310.html#KingM10

Jørgen Bang-Jensen Gary MacGillivray Jacobus Swarts The complexity of colouring by locally semicomplete digraphs. 2675-2684 2010 310 Discret. Math. 20 https://doi.org/10.1016/j.disc.2010.03.033 db/journals/dm/dm310.html#Bang-JensenMS10

Gary MacGillivray Jacobus Swarts The complexity of locally injective homomorphisms. 2685-2696 2010 310 Discret. Math. 20 https://doi.org/10.1016/j.disc.2010.03.034 https://www.wikidata.org/entity/Q114190776 db/journals/dm/dm310.html#MacGillivrayS10

K. Reji Kumar Gary MacGillivray Structure of the set of all minimal total dominating functions of some classes of graphs. 407-423 2010 30 Discuss. Math. Graph Theory 3 https://doi.org/10.7151/dmgt.1503 db/journals/dmgt/dmgt30.html#KumarM10

Stephen Finbow Gary MacGillivray The Firefighter Problem: a survey of results, directions and questions. 57-78 2009 43 Australas. J Comb. http://ajc.maths.uq.edu.au/pdf/43/ajc_v43_p057.pdf db/journals/ajc/ajc43.html#FinbowM09

Gary MacGillivray Mark H. Siggers On the complexity of H-colouring planar graphs. 5729-5738 2009 309 Discret. Math. 18 https://doi.org/10.1016/j.disc.2008.05.016 db/journals/dm/dm309.html#MacGillivrayS09

Richard C. Brewster Gary MacGillivray Laura Shepherd The circular chromatic number of hypergraphs. 5757-5765 2009 309 Discret. Math. 18 https://doi.org/10.1016/j.disc.2008.05.038 db/journals/dm/dm309.html#BrewsterMS09

Gary MacGillivray André Raspaud Jacobus Swarts Injective Oriented Colourings. 262-272 2009 WG https://doi.org/10.1007/978-3-642-11409-0_23 conf/wg/2009 db/conf/wg/wg2009.html#MacGillivrayRS09

K. Reji Kumar S. Arumugam 0001 Gary MacGillivray On Maximal Fractional Independent Sets In Graphs. 2008 87 Ars Comb. db/journals/arscom/arscom87.html#KumarAM08

Richard C. Brewster Tomás Feder Pavol Hell Jing Huang 0007 Gary MacGillivray Near-Unanimity Functions and Varieties of Reflexive Graphs. 938-960 2008 22 SIAM J. Discret. Math. 3 https://doi.org/10.1137/S0895480103436748 db/journals/siamdm/siamdm22.html#BrewsterFHHM08

Peter Dukes Gary MacGillivray Kristen Parton Bounds on the achromatic number of partial triple systems. 2007 2 Contributions Discret. Math. 1 https://doi.org/10.11575/cdm.v2i1.61930 db/journals/cdm/cdm2.html#DukesMP07

Stephen Finbow Andrew D. King Gary MacGillivray Romeo Rizzi The firefighter problem for graphs of maximum degree three. 2094-2105 2007 307 Discret. Math. 16 https://doi.org/10.1016/j.disc.2005.12.053 db/journals/dm/dm307.html#FinbowKMR07

Richard C. Brewster Gary MacGillivray Building blocks for the variety of absolute retracts. 1758-1764 2006 306 Discret. Math. 15 https://doi.org/10.1016/j.disc.2006.03.036 db/journals/dm/dm306.html#BrewsterM06

Gena Hahn Gary MacGillivray A note on k-cop, l-robber games on graphs. 2492-2497 2006 306 Discret. Math. 19-20 https://doi.org/10.1016/j.disc.2005.12.038 db/journals/dm/dm306.html#HahnM06

Shannon L. Fitzpatrick Gary MacGillivray Non 3-Choosable Bipartite Graphs and The Fano Plane. 2005 76 Ars Comb. db/journals/arscom/arscom76.html#FitzpatrickM05

William Klostermeyer Gary MacGillivray Homomorphisms and oriented colorings of equivalence classes of oriented graphs. 161-172 2004 274 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(03)00086-4 db/journals/dm/dm274.html#KlostermeyerM04

William Klostermeyer Gary MacGillivray Analogues of cliques for oriented coloring. 373-387 2004 24 Discuss. Math. Graph Theory 3 https://doi.org/10.7151/dmgt.1237 db/journals/dmgt/dmgt24.html#KlostermeyerM04

Ruth Haas Denis Hanson Gary MacGillivray Bounds For Partial List Colourings. 2003 67 Ars Comb. db/journals/arscom/arscom67.html#HaasHM03

Jing Huang 0007 Gary MacGillivray Anders Yeo Pushing vertices in digraphs without long induced cycles. 181-192 2002 121 Discret. Appl. Math. 1-3 db/journals/dam/dam121.html#HuangMY02 https://doi.org/10.1016/S0166-218X(01)00299-2

Sheila Ferneyhough Ruth Haas Denis Hanson Gary MacGillivray Star forests, dominating sets and Ramsey-type problems. 255-262 2002 245 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(01)00046-2 db/journals/dm/dm245.html#FerneyhoughHHM02

Shannon L. Fitzpatrick Gary MacGillivray Devon McCrea Total domination in complements of graphs containing no K4, 4. 143-151 2002 254 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(01)00369-7 db/journals/dm/dm254.html#FitzpatrickMM02

Gary MacGillivray Karen Seyffarth Classes of line graphs with small cycle double covers. 91-114 2001 24 Australas. J Comb. http://ajc.maths.uq.edu.au/pdf/24/ocr-ajc-v24-p91.pdf db/journals/ajc/ajc24.html#MacGillivrayS01

Richard C. Brewster Gary MacGillivray Minimizing b + D and well covered graphs. 2001 61 Ars Comb. db/journals/arscom/arscom61.html#BrewsterM01

Jing Huang 0007 Gary MacGillivray Kathryn L. B. Wood Pushing the cycles out of multipartite tournaments. 279-287 2001 231 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(00)00324-1 db/journals/dm/dm231.html#HuangMW01

Gary MacGillivray A. Rodriguez The achromatic number of the union of paths. 331-335 2001 231 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(00)00330-7 db/journals/dm/dm231.html#MacGillivrayR01

Gary MacGillivray Kathryn L. B. Wood Re-Orienting Tournaments by Pushing Vertices. 2000 57 Ars Comb. db/journals/arscom/arscom57.html#MacGillivrayW00

Ernest J. Cockayne Gary MacGillivray Jill Simmons CO-irredundant Ramsey numbers for graphs. 258-268 2000 34 J. Graph Theory 4 https://doi.org/10.1002/1097-0118(200008)34:4<258::AID-JGT2>3.0.CO;2-4 db/journals/jgt/jgt34.html#CockayneMS00

Richard C. Brewster Pavol Hell Gary MacGillivray The complexity of restricted graph homomorphisms. 145-154 1997 167-168 Discret. Math. https://doi.org/10.1016/S0012-365X(96)00223-3 https://www.wikidata.org/entity/Q127956983 db/journals/dm/dm167.html#BrewsterHM97

Denis Hanson Gary MacGillivray Bjarne Toft Choosability of bipartite graphs. 1996 44 Ars Comb. db/journals/arscom/arscom44.html#HansonMT96

Richard C. Brewster Gary MacGillivray Homomorphically Full Graphs. 23-31 1996 66 Discret. Appl. Math. 1 https://doi.org/10.1016/0166-218X(94)00134-Y https://www.wikidata.org/entity/Q126399701 db/journals/dam/dam66.html#BrewsterM96

S. Ao Ernest J. Cockayne Gary MacGillivray Christina M. Mynhardt Domination critical graphs with higher independent domination numbers. 9-14 1996 22 J. Graph Theory 1 https://doi.org/10.1002/(SICI)1097-0118(199605)22:1<9::AID-JGT2>3.0.CO;2-S db/journals/jgt/jgt22.html#AoCMM96

Gary MacGillivray Karen Seyffarth Domination numbers of planar graphs. 213-229 1996 22 J. Graph Theory 3 https://doi.org/10.1002/(SICI)1097-0118(199607)22:3<213::AID-JGT2>3.0.CO;2-P db/journals/jgt/jgt22.html#MacGillivrayS96

Jørgen Bang-Jensen Pavol Hell Gary MacGillivray Hereditarily hard H-colouring problems. 75-92 1995 138 Discret. Math. 1-3 https://doi.org/10.1016/0012-365X(94)00189-P db/journals/dm/dm138.html#Bang-JensenHM95

Jason E. Fulman Denis Hanson Gary MacGillivray Vertex domination-critical graphs. 41-43 1995 25 Networks 2 https://doi.org/10.1002/net.3230250203 db/journals/networks/networks25.html#FulmanHM95

Gary MacGillivray Graph Homomorphisms with Infinite Targets. 29-35 1994 54 Discret. Appl. Math. 1 https://doi.org/10.1016/0166-218X(94)90131-7 db/journals/dam/dam54.html#MacGillivray94

Ernest J. Cockayne Gary MacGillivray Christina M. Mynhardt Convexity of minimal dominating functions of trees - II. 137-146 1994 125 Discret. Math. 1-3 https://doi.org/10.1016/0012-365X(94)90154-6 db/journals/dm/dm125.html#CockayneMM94

Denis Hanson Ping Wang Gary MacGillivray A note on minimum graphs with girth pair (4, 2l + 1). 325-327 1994 18 J. Graph Theory 4 https://doi.org/10.1002/jgt.3190180403 db/journals/jgt/jgt18.html#HansonWM94

Denis Hanson Gary MacGillivray Dale Youngs The size of a minimum five-chromatic K4-free graph. 353-355 1993 122 Discret. Math. 1-3 https://doi.org/10.1016/0012-365X(93)90309-H db/journals/dm/dm122.html#HansonMY93

Jørgen Bang-Jensen Pavol Hell Gary MacGillivray On the complexity of colouring by superdigraphs of bipartite graphs. 27-44 1992 109 Discret. Math. 1-3 https://doi.org/10.1016/0012-365X(92)90276-L db/journals/dm/dm109.html#Bang-JensenHM92

Ernest J. Cockayne Odile Favaron Hao Li 0002 Gary MacGillivray The product of the independent domination numbers of a graph and its complement. 313-317 1991 90 Discret. Math. 3 https://doi.org/10.1016/0012-365X(91)90151-Q db/journals/dm/dm90.html#CockayneFLM91

Richard C. Brewster Gary MacGillivray A Note on Restricted H-Colouring. 149-151 1991 40 Inf. Process. Lett. 3 db/journals/ipl/ipl40.html#BrewsterM91 https://doi.org/10.1016/0020-0190(91)90171-D

Gary MacGillivray On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs. 397-408 1991 4 SIAM J. Discret. Math. 3 db/journals/siamdm/siamdm4.html#MacGillivray91 https://doi.org/10.1137/0404035

John A. Ellis Manrique Mata Gary MacGillivray A Linear Time Algorithm for Longest (s,t)-Paths in Weighted Outer Planar Graphs. 199-204 1989 32 Inf. Process. Lett. 4 db/journals/ipl/ipl32.html#EllisMM89 https://doi.org/10.1016/0020-0190(89)90044-6

Jørgen Bang-Jensen Pavol Hell Gary MacGillivray The Complexity of Colouring by Semicomplete Digraphs. 281-298 1988 1 SIAM J. Discret. Math. 3 db/journals/siamdm/siamdm1.html#Bang-JensenHM88 https://doi.org/10.1137/0401029

Bruno Amezcua-Osorio S. Ao Subramanian Arumugam 0001S. Arumugam 0001 Jørgen Bang-Jensen Stefan Bard Thomas Bellitto Anthony Bonato Richard C. Brewster Kelly Choo Nancy E. Clarke Ernest J. Cockayne Devvrit Christopher Duffy 0001 Peter Dukes Michelle Edwards John A. Ellis Odile Favaron Tomás Feder Sheila Ferneyhough Stephen Finbow Shannon L. Fitzpatrick Patrick W. Fowler Shinya Fujita 0001 Jason E. Fulman Ruth Haas Gena Hahn Denis Hanson Pavol Hell Michael A. Henning César Hernández-Cruz Julia Hoepner Seyyed Aliasghar Hosseini Jing Huang 0007 Arnott Kidner Andrew D. King William KlostermeyerWilliam F. Klostermeyer Aaron Krim-Yee K. Reji Kumar Nithish Kumar Hao Li 0002 Steve Lowdon Humberto Lozano-Chávez Manrique Mata Devon McCrea Christina M. Mynhardt Wendy J. Myrvold Shahla Nasserasr Pascal Ochem Kristen Parton Farzaneh Piri André Raspaud Shayla Redlin Romeo Rizzi A. Rodriguez Tadashi Sakuma Ben Seamone Saeed Semnani Karen Seyffarth Laura Shepherd Kailyn M. Sherk Mark H. Siggers Jill Simmons Aaron Slobodin Éric Sopena Jacobus Swarts Bjarne Toft Ben Tremblay Virgélot Virgile Ping Wang Ethan Williams Kathryn L. B. Wood Anqi Xu Feiran Yang 0003 Frank Yang Anders Yeo Dale Youngs