Brewster, Richard C.; Kidner, Arnott; MacGillivray, Gary The 2-colouring problem for \((m,n)\)-mixed graphs with switching is polynomial. (English) Zbl 1515.05063 Discrete Math. Theor. Comput. Sci. 24, No. 2, Paper No. 5, 12 p. (2022). Reviewer: Paola Bonacini (Catania) MSC: 05C15 68Q17 PDFBibTeX XMLCite \textit{R. C. Brewster} et al., Discrete Math. Theor. Comput. Sci. 24, No. 2, Paper No. 5, 12 p. (2022; Zbl 1515.05063) Full Text: DOI arXiv
Bard, Stefan; MacGillivray, Gary; Redlin, Shayla The complexity of frugal colouring. (English) Zbl 1462.05131 Arab. J. Math. 10, No. 1, 51-57 (2021). MSC: 05C15 68Q17 68R10 05C10 PDFBibTeX XMLCite \textit{S. Bard} et al., Arab. J. Math. 10, No. 1, 51--57 (2021; Zbl 1462.05131) Full Text: DOI
Duffy, Christopher; MacGillivray, Gary; Ochem, Pascal; Raspaud, André Oriented incidence colourings of digraphs. (English) Zbl 1401.05109 Discuss. Math., Graph Theory 39, No. 1, 191-210 (2019). MSC: 05C15 05C20 PDFBibTeX XMLCite \textit{C. Duffy} et al., Discuss. Math., Graph Theory 39, No. 1, 191--210 (2019; Zbl 1401.05109) Full Text: DOI
MacGillivray, Gary; Raspaud, André; Swarts, Jacobus Obstructions to locally injective oriented improper colourings. (English) Zbl 1292.05114 Eur. J. Comb. 35, 402-412 (2014). MSC: 05C15 PDFBibTeX XMLCite \textit{G. MacGillivray} et al., Eur. J. Comb. 35, 402--412 (2014; Zbl 1292.05114) Full Text: DOI
MacGillivray, Gary; Swarts, Jacobus The \(C_{k}\)-extended graft construction. (English) Zbl 1223.05300 Discrete Appl. Math. 159, No. 12, 1293-1301 (2011). MSC: 05C85 05C20 05C30 05C31 PDFBibTeX XMLCite \textit{G. MacGillivray} and \textit{J. Swarts}, Discrete Appl. Math. 159, No. 12, 1293--1301 (2011; Zbl 1223.05300) Full Text: DOI
MacGillivray, Gary; Swarts, Jacobus The complexity of locally injective homomorphisms. (English) Zbl 1219.05062 Discrete Math. 310, No. 20, 2685-2696 (2010). MSC: 05C20 05C60 05C15 PDFBibTeX XMLCite \textit{G. MacGillivray} and \textit{J. Swarts}, Discrete Math. 310, No. 20, 2685--2696 (2010; Zbl 1219.05062) Full Text: DOI
Bang-Jensen, Jørgen; MacGillivray, Gary; Swarts, Jacobus The complexity of colouring by locally semicomplete digraphs. (English) Zbl 1221.05173 Discrete Math. 310, No. 20, 2675-2684 (2010). MSC: 05C20 05C15 05C60 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Math. 310, No. 20, 2675--2684 (2010; Zbl 1221.05173) Full Text: DOI
Brewster, Richard C.; MacGillivray, Gary; Shepherd, Laura The circular chromatic number of hypergraphs. (English) Zbl 1213.05067 Discrete Math. 309, No. 18, 5757-5765 (2009). MSC: 05C15 05C65 PDFBibTeX XMLCite \textit{R. C. Brewster} et al., Discrete Math. 309, No. 18, 5757--5765 (2009; Zbl 1213.05067) Full Text: DOI
MacGillivray, G.; Siggers, M. On the complexity of \(H\)-colouring planar graphs. (English) Zbl 1213.05094 Discrete Math. 309, No. 18, 5729-5738 (2009). MSC: 05C15 05C10 05C38 05C85 68Q25 PDFBibTeX XMLCite \textit{G. MacGillivray} and \textit{M. Siggers}, Discrete Math. 309, No. 18, 5729--5738 (2009; Zbl 1213.05094) Full Text: DOI
Brewster, Richard C.; MacGillivray, Gary Building blocks for the variety of absolute retracts. (English) Zbl 1098.05071 Discrete Math. 306, No. 15, 1758-1764 (2006). MSC: 05C78 PDFBibTeX XMLCite \textit{R. C. Brewster} and \textit{G. MacGillivray}, Discrete Math. 306, No. 15, 1758--1764 (2006; Zbl 1098.05071) Full Text: DOI
Klostermeyer, William F.; MacGillivray, Gary Homomorphisms and oriented colorings of equivalence classes of oriented graphs. (English) Zbl 1032.05047 Discrete Math. 274, No. 1-3, 161-172 (2004). MSC: 05C15 68R10 05C20 PDFBibTeX XMLCite \textit{W. F. Klostermeyer} and \textit{G. MacGillivray}, Discrete Math. 274, No. 1--3, 161--172 (2004; Zbl 1032.05047) Full Text: DOI
MacGillivray, Gary; Yu, Min-Li Generalized partitions of graphs. (English) Zbl 0917.05056 Discrete Appl. Math. 91, No. 1-3, 143-153 (1999). Reviewer: Guojun Li (Jinan) MSC: 05C70 05C15 05C85 68R10 PDFBibTeX XMLCite \textit{G. MacGillivray} and \textit{M.-L. Yu}, Discrete Appl. Math. 91, No. 1--3, 143--153 (1999; Zbl 0917.05056) Full Text: DOI
Brewster, Richard C.; Hell, Pavol; MacGillivray, Gary The complexity of restricted graph homomorphisms. (English) Zbl 0873.68167 Discrete Math. 167-168, 145-154 (1997). MSC: 68R10 68Q25 05C15 05C20 PDFBibTeX XMLCite \textit{R. C. Brewster} et al., Discrete Math. 167--168, 145--154 (1997; Zbl 0873.68167) Full Text: DOI
Brewster, Richard; MacGillivray, Gary Homomorphically full graphs. (English) Zbl 0856.05093 Discrete Appl. Math. 66, No. 1, 23-31 (1996). Reviewer: R.Bodendiek (Kiel) MSC: 05C99 05C75 PDFBibTeX XMLCite \textit{R. Brewster} and \textit{G. MacGillivray}, Discrete Appl. Math. 66, No. 1, 23--31 (1996; Zbl 0856.05093) Full Text: DOI
Bang-Jensen, Jørgen; Hell, Pavol; MacGillivray, Gary Hereditarily hard \(H\)-colouring problems. (English) Zbl 0816.68090 Discrete Math. 138, No. 1-3, 75-92 (1995). MSC: 68R10 68Q25 05C15 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Math. 138, No. 1--3, 75--92 (1995; Zbl 0816.68090) Full Text: DOI
MacGillivray, Gary Graph homomorphisms with infinite targets. (English) Zbl 0812.68101 Discrete Appl. Math. 54, No. 1, 29-35 (1994). MSC: 68R10 05C15 68Q25 PDFBibTeX XMLCite \textit{G. MacGillivray}, Discrete Appl. Math. 54, No. 1, 29--35 (1994; Zbl 0812.68101) Full Text: DOI
Bang-Jensen, Jørgen; Hell, Pavol; MacGillivray, Gary On the complexity of colouring by superdigraphs of bipartite graphs. (English) Zbl 0783.05047 Discrete Math. 109, No. 1-3, 27-44 (1992). MSC: 05C15 68Q25 05C20 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Math. 109, No. 1--3, 27--44 (1992; Zbl 0783.05047) Full Text: DOI
Brewster, Richard; MacGillivray, Gary A note on restricted \(H\)-colouring. (English) Zbl 0761.05039 Inf. Process. Lett. 40, No. 3, 149-151 (1991). Reviewer: M.Kubale (Gdańsk) MSC: 05C15 68Q15 PDFBibTeX XMLCite \textit{R. Brewster} and \textit{G. MacGillivray}, Inf. Process. Lett. 40, No. 3, 149--151 (1991; Zbl 0761.05039) Full Text: DOI