Search the dblp DataBase
Gary MacGillivray :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Richard C. Brewster , Gary MacGillivray Minimizing b + D and well covered graphs. [Citation Graph (0, 0)][DBLP ] Ars Comb., 2001, v:61, n:, pp:- [Journal ] Shannon L. Fitzpatrick , Gary MacGillivray Non 3-Choosable Bipartite Graphs and The Fano Plane. [Citation Graph (0, 0)][DBLP ] Ars Comb., 2005, v:76, n:, pp:- [Journal ] Ruth Haas , Denis Hanson , Gary MacGillivray Bounds For Partial List Colourings. [Citation Graph (0, 0)][DBLP ] Ars Comb., 2003, v:67, n:, pp:- [Journal ] Denis Hanson , Gary MacGillivray , Bjarne Toft Choosability of bipartite graphs. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1996, v:44, n:, pp:- [Journal ] Gary MacGillivray , Kathryn L. B. Wood Re-Orienting Tournaments by Pushing Vertices. [Citation Graph (0, 0)][DBLP ] Ars Comb., 2000, v:57, n:, pp:- [Journal ] Richard C. Brewster , Gary MacGillivray Homomorphically Full Graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1996, v:66, n:1, pp:23-31 [Journal ] Jing Huang , Gary MacGillivray , Anders Yeo Pushing vertices in digraphs without long induced cycles. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:121, n:1-3, pp:181-192 [Journal ] Gary MacGillivray Graph Homomorphisms with Infinite Targets. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:54, n:1, pp:29-35 [Journal ] Shannon L. Fitzpatrick , Gary MacGillivray , Devon McCrea Total domination in complements of graphs containing no K 4, 4 . [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:254, n:1-3, pp:143-151 [Journal ] Sheila Ferneyhough , Ruth Haas , Denis Hanson , Gary MacGillivray Star forests, dominating sets and Ramsey-type problems. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:245, n:1-3, pp:255-262 [Journal ] Jing Huang , Gary MacGillivray , Kathryn L. B. Wood Pushing the cycles out of multipartite tournaments. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:231, n:1-3, pp:279-287 [Journal ] William Klostermeyer , Gary MacGillivray Homomorphisms and oriented colorings of equivalence classes of oriented graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:274, n:1-3, pp:161-172 [Journal ] Gary MacGillivray , A. Rodriguez The achromatic number of the union of paths. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:231, n:1-3, pp:331-335 [Journal ] Gena Hahn , Gary MacGillivray A note on k-cop, l-robber games on graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:19-20, pp:2492-2497 [Journal ] Richard C. Brewster , Gary MacGillivray Building blocks for the variety of absolute retracts. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:15, pp:1758-1764 [Journal ] Richard C. Brewster , Gary MacGillivray A Note on Restricted H-Colouring. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:40, n:3, pp:149-151 [Journal ] John A. Ellis , Manrique Mata , Gary MacGillivray A Linear Time Algorithm for Longest (s,t)-Paths in Weighted Outer Planar Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:32, n:4, pp:199-204 [Journal ] Jørgen Bang-Jensen , Pavol Hell , Gary MacGillivray The Complexity of Colouring by Semicomplete Digraphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1988, v:1, n:3, pp:281-298 [Journal ] Gary MacGillivray On the Complexity of Colouring by Vertex-Transitive and Arc-Transistive Digraphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1991, v:4, n:3, pp:397-408 [Journal ] Richard C. Brewster , Pavol Hell , Gary MacGillivray The complexity of restricted graph homomorphisms. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:167, n:, pp:145-154 [Journal ] Ernest J. Cockayne , Odile Favaron , Hao Li , Gary MacGillivray The product of the independent domination numbers of a graph and its complement. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1991, v:90, n:3, pp:313-317 [Journal ] Jørgen Bang-Jensen , Pavol Hell , Gary MacGillivray On the complexity of colouring by superdigraphs of bipartite graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1992, v:109, n:1-3, pp:27-44 [Journal ] Jørgen Bang-Jensen , Pavol Hell , Gary MacGillivray Hereditarily hard H-colouring problems. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1995, v:138, n:1-3, pp:75-92 [Journal ] Denis Hanson , Gary MacGillivray , Dale Youngs The size of a minimum five-chromatic K4 -free graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1993, v:122, n:1-3, pp:353-355 [Journal ] Ernest J. Cockayne , Gary MacGillivray , Christina M. Mynhardt Convexity of minimal dominating functions of trees - II. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1994, v:125, n:1-3, pp:137-146 [Journal ] Stephen Finbow , Andrew King , Gary MacGillivray , Romeo Rizzi The firefighter problem for graphs of maximum degree three. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:2094-2105 [Journal ] Injective Oriented Colourings. [Citation Graph (, )][DBLP ] On Maximal Fractional Independent Sets In Graphs. [Citation Graph (, )][DBLP ] The circular chromatic number of hypergraphs. [Citation Graph (, )][DBLP ] On the complexity of H-colouring planar graphs. [Citation Graph (, )][DBLP ] The firefighter problem for cubic graphs. [Citation Graph (, )][DBLP ] The complexity of colouring by locally semicomplete digraphs. [Citation Graph (, )][DBLP ] The complexity of locally injective homomorphisms. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.324secs