Jaffe, Adam Characterizing bipartite graphs which admit a \(k\)-NU polymorphism via absolute retracts. (English) Zbl 1479.05229 Graphs Comb. 37, No. 6, 2459-2466 (2021). MSC: 05C60 05C70 05C75 08B05 PDFBibTeX XMLCite \textit{A. Jaffe}, Graphs Comb. 37, No. 6, 2459--2466 (2021; Zbl 1479.05229) Full Text: DOI arXiv
Rafiey, Akbar; Rafiey, Arash; Santos, Thiago Toward a dichotomy for approximation of \(H\)-coloring. (English) Zbl 07561584 Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 91, 16 p. (2019). MSC: 68Nxx 68Qxx PDFBibTeX XMLCite \textit{A. Rafiey} et al., LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 91, 16 p. (2019; Zbl 07561584) Full Text: DOI arXiv
Madelaine, Florent R.; Martin, Barnaby Consistency for counting quantifiers. (English) Zbl 1510.68031 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 11, 13 p. (2018). MSC: 68Q25 03B70 08A70 PDFBibTeX XMLCite \textit{F. R. Madelaine} and \textit{B. Martin}, LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 11, 13 p. (2018; Zbl 1510.68031) Full Text: DOI
Siggers, Mark Reflexive graphs with near unanimity but no semilattice polymorphisms. (English) Zbl 1401.05253 Electron. J. Comb. 25, No. 4, Research Paper P4.2, 13 p. (2018). MSC: 05C75 08B05 06A07 PDFBibTeX XMLCite \textit{M. Siggers}, Electron. J. Comb. 25, No. 4, Research Paper P4.2, 13 p. (2018; Zbl 1401.05253) Full Text: Link
Larose, Benoit; Siggers, Mark NU polymorphisms on reflexive digraphs. (English) Zbl 1383.05134 SIAM J. Discrete Math. 32, No. 1, 728-749 (2018). MSC: 05C20 05C75 08B05 06A07 PDFBibTeX XMLCite \textit{B. Larose} and \textit{M. Siggers}, SIAM J. Discrete Math. 32, No. 1, 728--749 (2018; Zbl 1383.05134) Full Text: DOI
Larose, Benoit Algebra and the complexity of digraph CSPs: a survey. (English) Zbl 1482.68166 Krokhin, Andrei (ed.) et al., The constraint satisfaction problem: complexity and approximability, Dagstuhl seminar 15301, July 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. Dagstuhl Follow-Ups 7, 267-285 (2017). MSC: 68R07 05C20 08A70 68Q25 68R10 PDFBibTeX XMLCite \textit{B. Larose}, Dagstuhl Follow-Ups 7, 267--285 (2017; Zbl 1482.68166) Full Text: DOI
Yoshida, Yuichi Testing list \(H\)-homomorphisms. (English) Zbl 1353.68139 Comput. Complexity 25, No. 4, 737-773 (2016). MSC: 68Q25 05C60 08A70 68W20 PDFBibTeX XMLCite \textit{Y. Yoshida}, Comput. Complexity 25, No. 4, 737--773 (2016; Zbl 1353.68139) Full Text: DOI
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; Siggers, Mark Semilattice polymorphisms and chordal graphs. (English) Zbl 1284.05125 Eur. J. Comb. 36, 694-706 (2014). MSC: 05C25 PDFBibTeX XMLCite \textit{P. Hell} and \textit{M. Siggers}, Eur. J. Comb. 36, 694--706 (2014; Zbl 1284.05125) Full Text: DOI
Egri, László; Krokhin, Andrei; Larose, Benoit; Tesson, Pascal The complexity of the list homomorphism problem for graphs. (English) Zbl 1322.68100 Theory Comput. Syst. 51, No. 2, 143-178 (2012). Reviewer: Guillaume Fertin (Nantes) MSC: 68Q25 05C25 05C60 68Q17 PDFBibTeX XMLCite \textit{L. Egri} et al., Theory Comput. Syst. 51, No. 2, 143--178 (2012; Zbl 1322.68100) Full Text: DOI Link
Loten, Cynthia Absolute retracts and varieties generated by chordal graphs. (English) Zbl 1219.05156 Discrete Math. 310, No. 10-11, 1507-1519 (2010). MSC: 05C75 PDFBibTeX XMLCite \textit{C. Loten}, Discrete Math. 310, No. 10--11, 1507--1519 (2010; Zbl 1219.05156) 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
Feder, Tomás; Hell, Pavol; Huang, Jing The structure of bi-arc trees. (English) Zbl 1110.05093 Discrete Math. 307, No. 3-5, 393-401 (2007). MSC: 05C85 05C75 05C05 68R10 PDFBibTeX XMLCite \textit{T. Feder} et al., Discrete Math. 307, No. 3--5, 393--401 (2007; Zbl 1110.05093) 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
Feder, Tomas; Hell, Pavol; Huang, Jing Bi-arc graphs and the complexity of list homomorphisms. (English) Zbl 1057.05033 J. Graph Theory 42, No. 1, 61-80 (2003). Reviewer: Marek Kubale (Gdańsk) MSC: 05C15 05C85 68R10 PDFBibTeX XMLCite \textit{T. Feder} et al., J. Graph Theory 42, No. 1, 61--80 (2003; Zbl 1057.05033) Full Text: DOI