- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j47 |      | K. Reji Kumar, Gary MacGillivray: Efficient domination in circulant graphs. Discrete Mathematics 313(6): 767-771 (2013) |
| j46 | | Gary MacGillivray, Jacobus Swarts: Weak near-unanimity functions and digraph homomorphism problems. Theor. Comput. Sci. 477: 32-47 (2013) |
| 2012 | ||
| j45 | | Nancy E. Clarke, Gary MacGillivray: Characterizations of k-copwin graphs. Discrete Mathematics 312(8): 1421-1425 (2012) |
| 2011 | ||
| j44 | | 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 to Discrete Mathematics 6(2) (2011) |
| j43 | | Gary MacGillivray, Jacobus Swarts: The Ck-extended graft construction. Discrete Applied Mathematics 159(12): 1293-1301 (2011) |
| j42 | | Gary MacGillivray, André Raspaud, Jacobus Swarts: Obstructions to Injective Oriented Colourings. Electronic Notes in Discrete Mathematics 38: 597-605 (2011) |
| 2010 | ||
| j41 | | Andrew D. King, Gary MacGillivray: The firefighter problem for cubic graphs. Discrete Mathematics 310(3): 614-621 (2010) |
| j40 | | Jørgen Bang-Jensen, Gary MacGillivray, Jacobus Swarts: The complexity of colouring by locally semicomplete digraphs. Discrete Mathematics 310(20): 2675-2684 (2010) |
| j39 | | Gary MacGillivray, Jacobus Swarts: The complexity of locally injective homomorphisms. Discrete Mathematics 310(20): 2685-2696 (2010) |
| j38 | | K. Reji Kumar, Gary MacGillivray: Structure of the set of all minimal total dominating functions of some classes of graphs. Discussiones Mathematicae Graph Theory 30(3): 407-423 (2010) |
| 2009 | ||
| j37 | | Gary MacGillivray, Mark H. Siggers: On the complexity of H-colouring planar graphs. Discrete Mathematics 309(18): 5729-5738 (2009) |
| j36 | | Richard C. Brewster, Gary MacGillivray, Laura Shepherd: The circular chromatic number of hypergraphs. Discrete Mathematics 309(18): 5757-5765 (2009) |
| c1 | | |
| 2008 | ||
| j35 |  | K. Reji Kumar, S. Arumugam, Gary MacGillivray: On Maximal Fractional Independent Sets In Graphs. Ars Comb. 87 (2008) |
| j34 | | Richard C. Brewster, Tomás Feder, Pavol Hell, Jing Huang, Gary MacGillivray: Near-Unanimity Functions and Varieties of Reflexive Graphs. SIAM J. Discrete Math. 22(3): 938-960 (2008) |
| 2007 | ||
| j33 | | Peter Dukes, Gary MacGillivray, Kristen Parton: Bounds on the achromatic number of partial triple systems. Contributions to Discrete Mathematics 2(1) (2007) |
| j32 | | Stephen Finbow, Andrew D. King, Gary MacGillivray, Romeo Rizzi: The firefighter problem for graphs of maximum degree three. Discrete Mathematics 307(16): 2094-2105 (2007) |
| 2006 | ||
| j31 | | Richard C. Brewster, Gary MacGillivray: Building blocks for the variety of absolute retracts. Discrete Mathematics 306(15): 1758-1764 (2006) |
| j30 | | Gena Hahn, Gary MacGillivray: A note on k-cop, l-robber games on graphs. Discrete Mathematics 306(19-20): 2492-2497 (2006) |
| 2005 | ||
| j29 | | Shannon L. Fitzpatrick, Gary MacGillivray: Non 3-Choosable Bipartite Graphs and The Fano Plane. Ars Comb. 76 (2005) |
| 2004 | ||
| j28 | | William Klostermeyer, Gary MacGillivray: Homomorphisms and oriented colorings of equivalence classes of oriented graphs. Discrete Mathematics 274(1-3): 161-172 (2004) |
| j27 | | William Klostermeyer, Gary MacGillivray: Analogues of cliques for oriented coloring. Discussiones Mathematicae Graph Theory 24(3): 373-387 (2004) |
| 2003 | ||
| j26 | | |
| 2002 | ||
| j25 | | Jing Huang, Gary MacGillivray, Anders Yeo: Pushing vertices in digraphs without long induced cycles. Discrete Applied Mathematics 121(1-3): 181-192 (2002) |
| j24 | | Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary MacGillivray: Star forests, dominating sets and Ramsey-type problems. Discrete Mathematics 245(1-3): 255-262 (2002) |
| j23 | | Shannon L. Fitzpatrick, Gary MacGillivray, Devon McCrea: Total domination in complements of graphs containing no K4, 4. Discrete Mathematics 254(1-3): 143-151 (2002) |
| 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. Discrete Mathematics 231(1-3): 279-287 (2001) |
| j20 | | Gary MacGillivray, A. Rodriguez: The achromatic number of the union of paths. Discrete Mathematics 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. Journal of Graph Theory 34(4): 258-268 (2000) |
| 1997 | ||
| j17 | | Richard C. Brewster, Pavol Hell, Gary MacGillivray: The complexity of restricted graph homomorphisms. Discrete Mathematics 167-168: 145-154 (1997) |
| 1996 | ||
| j16 | | |
| j15 | | Richard C. Brewster, Gary MacGillivray: Homomorphically Full Graphs. Discrete Applied Mathematics 66(1): 23-31 (1996) |
| j14 | | S. Ao, Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt: Domination critical graphs with higher independent domination numbers. Journal of Graph Theory 22(1): 9-14 (1996) |
| j13 | | Gary MacGillivray, Karen Seyffarth: Domination numbers of planar graphs. Journal of Graph Theory 22(3): 213-229 (1996) |
| 1995 | ||
| j12 | | Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray: Hereditarily hard H-colouring problems. Discrete Mathematics 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. Discrete Applied Mathematics 54(1): 29-35 (1994) |
| j9 | | Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt: Convexity of minimal dominating functions of trees - II. Discrete Mathematics 125(1-3): 137-146 (1994) |
| j8 | | Denis Hanson, Ping Wang, Gary MacGillivray: A note on minimum graphs with girth pair (4, 2l + 1). Journal of 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. Discrete Mathematics 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. Discrete Mathematics 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. Discrete Mathematics 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. Discrete Math. 4(3): 397-408 (1991) |
| 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. Discrete Math. 1(3): 281-298 (1988) |
Colors in the list of coauthors
Last update Sun May 19 01:32:59 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page