Brewster, Richard C.; Feder, Tomas; Hell, Pavol; Huang, Jing; Macgillivray, Gary Near-unanimity functions and varieties of reflexive graphs. (English) Zbl 1200.05217 SIAM J. Discrete Math. 22, No. 3, 938-960 (2008). MSC: 05C85 68Q10 68W25 PDFBibTeX XMLCite \textit{R. C. Brewster} et al., SIAM J. Discrete Math. 22, No. 3, 938--960 (2008; Zbl 1200.05217) 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
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
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
Bang-Jensen, Jørgen; Hell, Pavol; MacGillivray, Gary The complexity of colouring by semicomplete digraphs. (English) Zbl 0678.05018 SIAM J. Discrete Math. 1, No. 3, 281-298 (1988). MSC: 05C15 05C20 68Q25 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., SIAM J. Discrete Math. 1, No. 3, 281--298 (1988; Zbl 0678.05018) Full Text: DOI