Chen, Hubie; Jansen, Bart M. P.; Okrasa, Karolina; Pieterse, Astrid; Rzążewski, Paweł Sparsification lower bounds for list \(H\)-coloring. (English) Zbl 07765416 Cao, Yixin (ed.) et al., 31st international symposium on algorithms and computation, ISAAC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 181, Article 58, 17 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{H. Chen} et al., LIPIcs -- Leibniz Int. Proc. Inform. 181, Article 58, 17 p. (2020; Zbl 07765416) Full Text: DOI arXiv
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
Chitnis, Rajesh; Egri, László; Marx, Dániel List H-coloring a graph by removing few vertices. (English) Zbl 1361.05085 Algorithmica 78, No. 1, 110-146 (2017). MSC: 05C60 05C15 05D15 68Q25 PDFBibTeX XMLCite \textit{R. Chitnis} et al., Algorithmica 78, No. 1, 110--146 (2017; Zbl 1361.05085) Full Text: DOI arXiv
Hell, Pavol; Mishra, Aurosish \(H\)-coloring degree-bounded (acyclic) digraphs. (English) Zbl 1382.68112 Theor. Comput. Sci. 554, 40-49 (2014). MSC: 68Q25 05C15 05C20 05C85 68Q17 PDFBibTeX XMLCite \textit{P. Hell} and \textit{A. Mishra}, Theor. Comput. Sci. 554, 40--49 (2014; Zbl 1382.68112) 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
Nešetřil, Jaroslav; Siggers, Mark H.; Zádori, László A combinatorial constraint satisfaction problem dichotomy classification conjecture. (English) Zbl 1187.68250 Eur. J. Comb. 31, No. 1, 280-296 (2010). MSC: 68Q17 90C27 PDFBibTeX XMLCite \textit{J. Nešetřil} et al., Eur. J. Comb. 31, No. 1, 280--296 (2010; Zbl 1187.68250) Full Text: DOI
Jonsson, Peter; Krokhin, Andrei; Kuivinen, Fredrik Hard constraint satisfaction problems have hard gaps at location 1. (English) Zbl 1176.90498 Theor. Comput. Sci. 410, No. 38-40, 3856-3874 (2009). MSC: 90C27 68W25 68Q17 PDFBibTeX XMLCite \textit{P. Jonsson} et al., Theor. Comput. Sci. 410, No. 38--40, 3856--3874 (2009; Zbl 1176.90498) Full Text: DOI
Feder, Tomas; Hell, Pavol; Huang, Jing Extension problems with degree bounds. (English) Zbl 1177.05037 Discrete Appl. Math. 157, No. 7, 1592-1599 (2009). MSC: 05C15 05C85 68Q25 PDFBibTeX XMLCite \textit{T. Feder} et al., Discrete Appl. Math. 157, No. 7, 1592--1599 (2009; Zbl 1177.05037) Full Text: DOI
Siggers, Mark H. Dichotomy for bounded degree \(H\)-colouring. (English) Zbl 1213.05100 Discrete Appl. Math. 157, No. 2, 201-210 (2009). MSC: 05C15 PDFBibTeX XMLCite \textit{M. H. Siggers}, Discrete Appl. Math. 157, No. 2, 201--210 (2009; Zbl 1213.05100) 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
Färnqvist, Tommy; Jonsson, Peter Bounded tree-width and CSP-related problems. (English) Zbl 1193.68130 Tokuyama, Takeshi (ed.), Algorithms and computation. 18th international symposium, ISAAC 2007, Sendai, Japan, December 17–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77118-0/pbk). Lecture Notes in Computer Science 4835, 632-643 (2007). MSC: 68Q25 05C05 05C85 68Q17 68R10 68W25 PDFBibTeX XMLCite \textit{T. Färnqvist} and \textit{P. Jonsson}, Lect. Notes Comput. Sci. 4835, 632--643 (2007; Zbl 1193.68130) Full Text: DOI
Feder, Tomás; Hell, Pavol; Huang, Jing List homomorphisms of graphs with bounded degrees. (English) Zbl 1111.05035 Discrete Math. 307, No. 3-5, 386-392 (2007). MSC: 05C15 05C85 68R10 PDFBibTeX XMLCite \textit{T. Feder} et al., Discrete Math. 307, No. 3--5, 386--392 (2007; Zbl 1111.05035) Full Text: DOI
Büki, Judit; Szabó, Csaba Complexity of homomorphisms to direct products of graphs. (English) Zbl 1032.68084 Inf. Process. Lett. 81, No. 4, 175-178 (2002). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{J. Büki} and \textit{C. Szabó}, Inf. Process. Lett. 81, No. 4, 175--178 (2002; Zbl 1032.68084) Full Text: DOI
Feder, Tomas; Hell, Pavol List homomorphisms to reflexive graphs. (English) Zbl 0904.05078 J. Comb. Theory, Ser. B 72, No. 2, 236-250 (1998). Reviewer: P.Hell (Burnaby, BC) MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{T. Feder} and \textit{P. Hell}, J. Comb. Theory, Ser. B 72, No. 2, 236--250 (1998; Zbl 0904.05078) Full Text: DOI