Person:189757: Difference between revisions

From MaRDI portal
Person:189757
Created automatically from import230922100950
 
m AuthorDisambiguator moved page Gary MacGillivray to Gary MacGillivray: Duplicate
 
(No difference)

Latest revision as of 20:40, 8 December 2023

Available identifiers

zbMath Open macgillivray.garyMaRDI QIDQ189757

List of research outcomes





PublicationDate of PublicationType
Homomorphically full oriented graphs2024-09-06Paper
Proving exact values for the \(2\)-limited broadcast domination number on grid graphs2024-09-06Paper
Strongly \(i\)-bicritical graphs2024-08-13Paper
2-limited broadcast domination on grid graphs2023-08-02Paper
A dichotomy theorem for $\Gamma$-switchable $H$-colouring on $m$-edge coloured graphs2023-06-09Paper
The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial2023-05-31Paper
Boundary and Hearing Independent Broadcasts in Graphs and Trees2023-05-04Paper
Fractional eternal domination: securely distributing resources across a network2023-04-23Paper
Efficient \((j, k)\)-dominating functions2022-12-02Paper
Eternal domination and clique covering2022-11-29Paper
Obstructions to some injective oriented colourings2022-07-25Paper
Complexity of injective homomorphisms to small tournaments, and of injective oriented colourings2022-07-25Paper
Switching $m$-edge-coloured graphs using non-Abelian groups2022-07-25Paper
Broadcast Domination in Graphs2021-12-14Paper
Switching $(m, n)$-mixed graphs with respect to Abelian groups2021-10-04Paper
The complexity of frugal colouring2021-05-03Paper
Colourings of $(m, n)$-coloured mixed graphs2020-10-18Paper
2-limited broadcast domination in subcubic graphs2020-08-31Paper
https://portal.mardi4nfdi.de/entity/Q32954972020-07-10Paper
Inertias of Laplacian matrices of weighted signed graphs2020-02-26Paper
https://portal.mardi4nfdi.de/entity/Q52439962019-11-19Paper
Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs2019-10-29Paper
The Firefighter problem: Saving sets of vertices on cubic graphs2019-08-01Paper
Broadcast domination and multipacking in strongly chordal graphs2019-05-17Paper
Oriented colourings of graphs with maximum degree three and four2019-02-20Paper
https://portal.mardi4nfdi.de/entity/Q46226312019-02-13Paper
A Study of $k$-dipath Colourings of Oriented Graphs2018-12-10Paper
Complexity of locally-injective homomorphisms to tournaments2018-12-10Paper
Oriented incidence colourings of digraphs2018-12-05Paper
\(k\)-broadcast domination and \(k\)-multipacking2018-10-26Paper
Reconfiguring minimum dominating sets: the \(\gamma\)-graph of a tree2018-06-29Paper
Perfect Roman domination in trees2018-01-11Paper
Characterizations and algorithms for generalized Cops and Robbers games2017-12-20Paper
https://portal.mardi4nfdi.de/entity/Q45983702017-12-20Paper
Reconfiguring k-colourings of Complete Bipartite Graphs2017-09-26Paper
https://portal.mardi4nfdi.de/entity/Q49775002017-08-16Paper
Integer solutions to \(x^2+ y^2= z^2-k\) for a fixed integer value \(k\)2017-06-14Paper
Eternal domination: criticality and reachability2017-01-23Paper
https://portal.mardi4nfdi.de/entity/Q28293562016-10-27Paper
Safe set problem on graphs2016-10-07Paper
https://portal.mardi4nfdi.de/entity/Q27919712016-03-16Paper
https://portal.mardi4nfdi.de/entity/Q54999192015-08-05Paper
A simple method of computing the catch time2015-01-26Paper
Eternal Domination in Trees2015-01-26Paper
https://portal.mardi4nfdi.de/entity/Q29382382015-01-14Paper
https://portal.mardi4nfdi.de/entity/Q28782262014-08-28Paper
Obstructions to locally injective oriented improper colourings2014-07-29Paper
https://portal.mardi4nfdi.de/entity/Q51677242014-07-01Paper
https://portal.mardi4nfdi.de/entity/Q28574122013-11-01Paper
https://portal.mardi4nfdi.de/entity/Q52989002013-06-25Paper
Weak near-unanimity functions and digraph homomorphism problems2013-04-17Paper
Efficient domination in circulant graphs2013-03-19Paper
https://portal.mardi4nfdi.de/entity/Q31660932012-10-21Paper
Foolproof eternal domination in the all-guards move model2012-08-27Paper
Characterizations of \(k\)-copwin graphs2012-03-29Paper
Gray code numbers for graphs2012-03-07Paper
https://portal.mardi4nfdi.de/entity/Q30892992011-08-24Paper
The \(C_{k}\)-extended graft construction2011-08-10Paper
Structure of the set of all minimal total dominating functions of some classes of graphs2011-05-09Paper
https://portal.mardi4nfdi.de/entity/Q30702852011-02-02Paper
The complexity of colouring by locally semicomplete digraphs2010-10-18Paper
The complexity of locally injective homomorphisms2010-10-18Paper
https://portal.mardi4nfdi.de/entity/Q35585942010-05-05Paper
The firefighter problem for cubic graphs2010-03-29Paper
Injective Oriented Colourings2010-01-21Paper
On the complexity of \(H\)-colouring planar graphs2009-12-15Paper
The circular chromatic number of hypergraphs2009-12-15Paper
Near-Unanimity Functions and Varieties of Reflexive Graphs2009-08-20Paper
https://portal.mardi4nfdi.de/entity/Q36355642009-07-06Paper
https://portal.mardi4nfdi.de/entity/Q36140152009-03-16Paper
Primitive digraphs with smallest large exponent2008-03-14Paper
https://portal.mardi4nfdi.de/entity/Q54410542008-02-07Paper
The firefighter problem for graphs of maximum degree three2007-06-26Paper
A note on \(k\)-cop, \(l\)-robber games on graphs2006-10-30Paper
https://portal.mardi4nfdi.de/entity/Q54925762006-10-16Paper
Building blocks for the variety of absolute retracts2006-09-13Paper
Eternally secure sets, independence sets and cliques2006-05-09Paper
https://portal.mardi4nfdi.de/entity/Q57036822005-11-08Paper
https://portal.mardi4nfdi.de/entity/Q54633382005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54614652005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q27159682005-07-20Paper
Spectrally arbitrary star sign patterns2005-06-01Paper
Analogues of cliques for oriented coloring2005-04-19Paper
https://portal.mardi4nfdi.de/entity/Q48262702004-11-11Paper
https://portal.mardi4nfdi.de/entity/Q44575462004-03-25Paper
https://portal.mardi4nfdi.de/entity/Q44582142004-03-17Paper
Homomorphisms and oriented colorings of equivalence classes of oriented graphs2004-01-26Paper
Pushing vertices in digraphs without long induced cycles2002-08-29Paper
Total domination in complements of graphs containing no \(K _{4,4}\)2002-08-29Paper
Star forests, dominating sets and Ramsey-type problems2002-05-15Paper
Pushing the cycles out of multipartite tournaments2002-03-04Paper
https://portal.mardi4nfdi.de/entity/Q27604602002-01-02Paper
https://portal.mardi4nfdi.de/entity/Q45048892001-03-08Paper
Generalized partitions of graphs1999-07-18Paper
https://portal.mardi4nfdi.de/entity/Q42117391999-03-02Paper
https://portal.mardi4nfdi.de/entity/Q43882091998-05-17Paper
https://portal.mardi4nfdi.de/entity/Q43877181998-05-13Paper
The complexity of restricted graph homomorphisms1997-10-09Paper
https://portal.mardi4nfdi.de/entity/Q43430511997-10-07Paper
https://portal.mardi4nfdi.de/entity/Q31264421997-08-14Paper
Domination numbers of planar graphs1997-01-05Paper
https://portal.mardi4nfdi.de/entity/Q48791601996-07-08Paper
Homomorphically full graphs1996-07-07Paper
https://portal.mardi4nfdi.de/entity/Q48736841996-04-17Paper
https://portal.mardi4nfdi.de/entity/Q48537521995-11-01Paper
Hereditarily hard \(H\)-colouring problems1995-07-19Paper
Vertex domination‐critical graphs1995-05-14Paper
Graph homomorphisms with infinite targets1994-11-03Paper
Convexity of minimal dominating functions of trees. II1994-08-07Paper
A note on minimum graphs with girth pair (4, 2l + 1)1994-07-04Paper
The size of a minimum five-chromatic \(K_ 4\)-free graph1994-06-06Paper
On the complexity of colouring by superdigraphs of bipartite graphs1993-10-14Paper
https://portal.mardi4nfdi.de/entity/Q42015771993-08-25Paper
A note on restricted \(H\)-colouring1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39870401992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39870411992-06-28Paper
The product of the independent domination numbers of a graph and its complement1992-06-26Paper
Atom probe tomography characterization of solute segregation to dislocations and interfaces1992-06-25Paper
A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38047291988-01-01Paper
The Complexity of Colouring by Semicomplete Digraphs1988-01-01Paper
Homomorphically Full Oriented GraphsN/APaper
Proving exact values for the $2$-limited broadcast domination number on grid graphsN/APaper

Research outcomes over time

This page was built for person: Gary MacGillivray