Gary MacGillivray

According to our database1, Gary MacGillivray authored at least 80 papers between 1988 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
2-limited broadcast domination on grid graphs.
Discret. Appl. Math., October, 2023

Efficient (j, k)-dominating functions.
Discuss. Math. Graph Theory, 2023

A dichotomy theorem for Γ-switchable H-colouring on m-edge coloured graphs.
CoRR, 2023

Fractional eternal domination: securely distributing resources across a network.
CoRR, 2023

2022
Eternal domination and clique covering.
Electron. J. Graph Theory Appl., 2022

The 2-colouring problem for (m,n)-mixed graphs with switching is polynomial.
Discret. Math. Theor. Comput. Sci., 2022

Homomorphically Full Oriented Graphs.
CoRR, 2022

2020
2-limited broadcast domination in subcubic graphs.
Discret. Appl. Math., 2020

Colourings of (m, n)-coloured mixed graphs.
CoRR, 2020

The firefighter problem on orientations of the cubic grid.
Bull. ICA, 2020

2019
The Firefighter problem: Saving sets of vertices on cubic graphs.
Networks, 2019

Oriented incidence colourings of digraphs.
Discuss. Math. Graph Theory, 2019

Oriented colourings of graphs with maximum degree three and four.
Discret. Math., 2019

Broadcast domination and multipacking in strongly chordal graphs.
Discret. Appl. Math., 2019

2018
A Study of k-dipath Colourings of Oriented Graphs.
Discret. Math. Theor. Comput. Sci., 2018

Complexity of locally-injective homomorphisms to tournaments.
Discret. Math. Theor. Comput. Sci., 2018

Reconfiguring minimum dominating sets: the <i>?</i>-graph of a tree.
Discuss. Math. Graph Theory, 2018

k-broadcast domination and k-multipacking.
Discret. Appl. Math., 2018

Perfect Roman domination in trees.
Discret. Appl. Math., 2018

Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs.
Algorithms, 2018

2017
Eternal domination: criticality and reachability.
Discuss. Math. Graph Theory, 2017

Bounds for the $m$-Eternal Domination Number of a Graph.
Contributions Discret. Math., 2017

Characterizations and algorithms for generalized Cops and Robbers games.
Contributions Discret. Math., 2017

2016
Safe set problem on graphs.
Discret. Appl. Math., 2016

2014
Obstructions to locally injective oriented improper colourings.
Eur. J. Comb., 2014

Conditional Colourings with Given Template.
Discret. Math. Theor. Comput. Sci., 2014

A simple method of computing the catch time.
Ars Math. Contemp., 2014

A theory of 2-dipath colourings.
Australas. J Comb., 2014

2013
Weak near-unanimity functions and digraph homomorphism problems.
Theor. Comput. Sci., 2013

Efficient domination in circulant graphs.
Discret. Math., 2013

2012
Characterizations of k-copwin graphs.
Discret. Math., 2012

The diameter of total domination and independent domination vertex-critical graphs.
Australas. J Comb., 2012

2011
Obstructions to Injective Oriented Colourings.
Electron. Notes Discret. Math., 2011

The C<sub>k</sub>-extended graft construction.
Discret. Appl. Math., 2011

A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles.
Contributions Discret. Math., 2011

Gray code numbers for graphs.
Ars Math. Contemp., 2011

2010
Structure of the set of all minimal total dominating functions of some classes of graphs.
Discuss. Math. Graph Theory, 2010

The complexity of locally injective homomorphisms.
Discret. Math., 2010

The firefighter problem for cubic graphs.
Discret. Math., 2010

The complexity of colouring by locally semicomplete digraphs.
Discret. Math., 2010

2009
On the complexity of H-colouring planar graphs.
Discret. Math., 2009

The circular chromatic number of hypergraphs.
Discret. Math., 2009

The Firefighter Problem: a survey of results, directions and questions.
Australas. J Comb., 2009

Injective Oriented Colourings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

2008
Near-Unanimity Functions and Varieties of Reflexive Graphs.
SIAM J. Discret. Math., 2008

On Maximal Fractional Independent Sets In Graphs.
Ars Comb., 2008

2007
The firefighter problem for graphs of maximum degree three.
Discret. Math., 2007

Bounds on the achromatic number of partial triple systems.
Contributions Discret. Math., 2007

2006
A note on k-cop, l-robber games on graphs.
Discret. Math., 2006

Building blocks for the variety of absolute retracts.
Discret. Math., 2006

2005
Non 3-Choosable Bipartite Graphs and The Fano Plane.
Ars Comb., 2005

2004
Analogues of cliques for oriented coloring.
Discuss. Math. Graph Theory, 2004

Homomorphisms and oriented colorings of equivalence classes of oriented graphs.
Discret. Math., 2004

2003
Bounds For Partial List Colourings.
Ars Comb., 2003

2002
Total domination in complements of graphs containing no <i>K</i><sub>4, 4</sub>.
Discret. Math., 2002

Star forests, dominating sets and Ramsey-type problems.
Discret. Math., 2002

Pushing vertices in digraphs without long induced cycles.
Discret. Appl. Math., 2002

2001
The achromatic number of the union of paths.
Discret. Math., 2001

Pushing the cycles out of multipartite tournaments.
Discret. Math., 2001

Minimizing b + D and well covered graphs.
Ars Comb., 2001

Classes of line graphs with small cycle double covers.
Australas. J Comb., 2001

2000
CO-irredundant Ramsey numbers for graphs.
J. Graph Theory, 2000

Re-Orienting Tournaments by Pushing Vertices.
Ars Comb., 2000

1997
The complexity of restricted graph homomorphisms.
Discret. Math., 1997

1996
Domination numbers of planar graphs.
J. Graph Theory, 1996

Domination critical graphs with higher independent domination numbers.
J. Graph Theory, 1996

Homomorphically Full Graphs.
Discret. Appl. Math., 1996

Choosability of bipartite graphs.
Ars Comb., 1996

1995
Vertex domination-critical graphs.
Networks, 1995

Hereditarily hard H-colouring problems.
Discret. Math., 1995

1994
A note on minimum graphs with girth pair (4, 2<i>l</i> + 1).
J. Graph Theory, 1994

Convexity of minimal dominating functions of trees - II.
Discret. Math., 1994

Graph Homomorphisms with Infinite Targets.
Discret. Appl. Math., 1994

1993
The size of a minimum five-chromatic K<sub>4</sub>-free graph.
Discret. Math., 1993

1992
On the complexity of colouring by superdigraphs of bipartite graphs.
Discret. Math., 1992

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

A Note on Restricted H-Colouring.
Inf. Process. Lett., 1991

The product of the independent domination numbers of a graph and its complement.
Discret. Math., 1991

1989
A Linear Time Algorithm for Longest (s,t)-Paths in Weighted Outer Planar Graphs.
Inf. Process. Lett., 1989

1988
The Complexity of Colouring by Semicomplete Digraphs.
SIAM J. Discret. Math., 1988


  Loading...