The following pages link to Gary MacGillivray (Q189757):
Displaying 50 items.
- Safe set problem on graphs (Q323046) (← links)
- Characterizations of \(k\)-copwin graphs (Q408176) (← links)
- Eternal domination: criticality and reachability (Q505466) (← links)
- On the complexity of colouring by superdigraphs of bipartite graphs (Q686279) (← links)
- The complexity of colouring by locally semicomplete digraphs (Q709314) (← links)
- The complexity of locally injective homomorphisms (Q709315) (← links)
- The firefighter problem for cubic graphs (Q960975) (← links)
- (Q1045064) (redirect page) (← links)
- On the complexity of \(H\)-colouring planar graphs (Q1045065) (← links)
- The circular chromatic number of hypergraphs (Q1045069) (← links)
- The product of the independent domination numbers of a graph and its complement (Q1179268) (← links)
- A note on restricted \(H\)-colouring (Q1183461) (← links)
- A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs (Q1263968) (← links)
- Generalized partitions of graphs (Q1283792) (← links)
- The size of a minimum five-chromatic \(K_ 4\)-free graph (Q1313876) (← links)
- Convexity of minimal dominating functions of trees. II (Q1322265) (← links)
- Graph homomorphisms with infinite targets (Q1336635) (← links)
- Star forests, dominating sets and Ramsey-type problems (Q1348128) (← links)
- The complexity of restricted graph homomorphisms (Q1356452) (← links)
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs (Q1421519) (← links)
- Pushing vertices in digraphs without long induced cycles (Q1613399) (← links)
- Total domination in complements of graphs containing no \(K _{4,4}\) (Q1613536) (← links)
- Oriented incidence colourings of digraphs (Q1630937) (← links)
- Reconfiguring minimum dominating sets: the \(\gamma\)-graph of a tree (Q1649910) (← links)
- Perfect Roman domination in trees (Q1693150) (← links)
- Oriented colourings of graphs with maximum degree three and four (Q1727768) (← links)
- Spectrally arbitrary star sign patterns (Q1779256) (← links)
- \(k\)-broadcast domination and \(k\)-multipacking (Q1801065) (← links)
- Hereditarily hard \(H\)-colouring problems (Q1842146) (← links)
- Homomorphically full graphs (Q1917297) (← links)
- Efficient domination in circulant graphs (Q1942669) (← links)
- Weak near-unanimity functions and digraph homomorphism problems (Q1945940) (← links)
- The complexity of frugal colouring (Q2023759) (← links)
- Efficient \((j, k)\)-dominating functions (Q2107745) (← links)
- 2-limited broadcast domination in subcubic graphs (Q2197488) (← links)
- The \(C_{k}\)-extended graft construction (Q2275937) (← links)
- Inertias of Laplacian matrices of weighted signed graphs (Q2302885) (← links)
- Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs (Q2331438) (← links)
- Integer solutions to \(x^2+ y^2= z^2-k\) for a fixed integer value \(k\) (Q2357683) (← links)
- Eternally secure sets, independence sets and cliques (Q2369386) (← links)
- The firefighter problem for graphs of maximum degree three (Q2370449) (← links)
- Broadcast domination and multipacking in strongly chordal graphs (Q2414458) (← links)
- A note on \(k\)-cop, \(l\)-robber games on graphs (Q2433710) (← links)
- Primitive digraphs with smallest large exponent (Q2477548) (← links)
- Building blocks for the variety of absolute retracts (Q2502901) (← links)
- Obstructions to locally injective oriented improper colourings (Q2509767) (← links)
- (Q2715968) (← links)
- (Q2760460) (← links)
- (Q2791971) (← links)
- (Q2829356) (← links)
