Foucaud, Florent; Harutyunyan, Ararat; Hell, Pavol; Legay, Sylvain; Manoussakis, Yannis; Naserasr, Reza The complexity of tropical graph homomorphisms. (English) Zbl 1367.05141 Discrete Appl. Math. 229, 64-81 (2017). MSC: 05C60 05C15 PDFBibTeX XMLCite \textit{F. Foucaud} et al., Discrete Appl. Math. 229, 64--81 (2017; Zbl 1367.05141) Full Text: DOI arXiv
Goldberg, Leslie Ann; Jerrum, Mark The complexity of approximately counting tree homomorphisms. (English) Zbl 1321.68312 ACM Trans. Comput. Theory 6, No. 2, Article No. 8, 31 p. (2014). MSC: 68Q25 05C05 68Q15 68R10 82B20 82C20 PDFBibTeX XMLCite \textit{L. A. Goldberg} and \textit{M. Jerrum}, ACM Trans. Comput. Theory 6, No. 2, Article No. 8, 31 p. (2014; Zbl 1321.68312) Full Text: DOI arXiv
Hell, Pavol Graph partitions with prescribed patterns. (English) Zbl 1292.05214 Eur. J. Comb. 35, 335-353 (2014). MSC: 05C70 05C69 05C15 05C50 PDFBibTeX XMLCite \textit{P. Hell}, Eur. J. Comb. 35, 335--353 (2014; Zbl 1292.05214) Full Text: DOI
Hell, Pavol; Nešetřil, Jaroslav Colouring, constraint satisfaction, and complexity. (English) Zbl 1302.68251 Comput. Sci. Rev. 2, No. 3, 143-163 (2008). MSC: 68T20 05C15 68Q25 68-02 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Comput. Sci. Rev. 2, No. 3, 143--163 (2008; Zbl 1302.68251) Full Text: DOI
Brewster, Richard C.; Graves, Timothy On the restricted homomorphism problem. (English) Zbl 1151.68042 Discrete Appl. Math. 156, No. 14, 2823-2826 (2008). MSC: 68R10 68Q25 05C20 PDFBibTeX XMLCite \textit{R. C. Brewster} and \textit{T. Graves}, Discrete Appl. Math. 156, No. 14, 2823--2826 (2008; Zbl 1151.68042) Full Text: DOI
Bulatov, Andrei A.; Dalmau, Víctor Towards a dichotomy theorem for the counting constraint satisfaction problem. (English) Zbl 1115.68141 Inf. Comput. 205, No. 5, 651-678 (2007). MSC: 68T20 68Q25 PDFBibTeX XMLCite \textit{A. A. Bulatov} and \textit{V. Dalmau}, Inf. Comput. 205, No. 5, 651--678 (2007; Zbl 1115.68141) Full Text: DOI Link
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
Hell, Pavol; Nešetřil, Jaroslav; Zhu, Xuding Complexity of tree homomorphisms. (English) Zbl 0868.05018 Discrete Appl. Math. 70, No. 1, 23-36 (1996). Reviewer: P.Kirschenhofer (Leoben) MSC: 05C05 68R10 05C15 05C38 PDFBibTeX XMLCite \textit{P. Hell} et al., Discrete Appl. Math. 70, No. 1, 23--36 (1996; Zbl 0868.05018) Full Text: DOI Link
Hell, Pavol; Zhu, Xuding Homomorphisms to oriented paths. (English) Zbl 0819.05030 Discrete Math. 132, No. 1-3, 107-114 (1994). Reviewer: J.Bang-Jensen (Odense) MSC: 05C20 05C38 05C75 05C15 PDFBibTeX XMLCite \textit{P. Hell} and \textit{X. Zhu}, Discrete Math. 132, No. 1--3, 107--114 (1994; Zbl 0819.05030) 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 The effect of two cycles on the complexity of colourings by directed graphs. (English) Zbl 0697.05029 Discrete Appl. Math. 26, No. 1, 1-23 (1990). Reviewer: J.W.Moon MSC: 05C15 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{P. Hell}, Discrete Appl. Math. 26, No. 1, 1--23 (1990; Zbl 0697.05029) Full Text: DOI