Bok, Jan; Brewster, Richard; Feder, Tomás; Hell, Pavol; Jedličková, Nikola List homomorphism problems for signed trees. (English) Zbl 1506.05082 Discrete Math. 346, No. 3, Article ID 113257, 24 p. (2023). MSC: 05C22 05C05 68Q15 05C60 PDFBibTeX XMLCite \textit{J. Bok} et al., Discrete Math. 346, No. 3, Article ID 113257, 24 p. (2023; Zbl 1506.05082) Full Text: DOI
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
Haney, Samuel; Liaee, Mehraneh; Maggs, Bruce M.; Panigrahi, Debmalya; Rajaraman, Rajmohan; Sundaram, Ravi Retracting graphs to cycles. (English) Zbl 07561563 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 70, 15 p. (2019). MSC: 68Nxx 68Qxx PDFBibTeX XMLCite \textit{S. Haney} et al., LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 70, 15 p. (2019; Zbl 07561563) Full Text: DOI arXiv
Focke, Jacob; Goldberg, Leslie Ann; Živný, Stanislav The complexity of counting surjective homomorphisms and compactions. (English) Zbl 1429.05143 SIAM J. Discrete Math. 33, No. 2, 1006-1043 (2019). MSC: 05C60 05C30 PDFBibTeX XMLCite \textit{J. Focke} et al., SIAM J. Discrete Math. 33, No. 2, 1006--1043 (2019; Zbl 1429.05143) Full Text: DOI
Brewster, Richard C.; Siggers, Mark A complexity dichotomy for signed \(\mathbf{H}\)-colouring. (English) Zbl 1393.05108 Discrete Math. 341, No. 10, 2768-2773 (2018). MSC: 05C15 05C22 PDFBibTeX XMLCite \textit{R. C. Brewster} and \textit{M. Siggers}, Discrete Math. 341, No. 10, 2768--2773 (2018; Zbl 1393.05108) Full Text: DOI
Martin, Barnaby Quantified constraints in twenty seventeen. (English) Zbl 1482.68168 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, 327-346 (2017). MSC: 68R07 08A70 68Q25 68Q27 PDFBibTeX XMLCite \textit{B. Martin}, Dagstuhl Follow-Ups 7, 327--346 (2017; Zbl 1482.68168) 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
Golovach, Petr A.; Johnson, Matthew; Martin, Barnaby; Paulusma, Daniël; Stewart, Anthony Surjective \(H\)-colouring: new hardness results. (English) Zbl 1489.68192 Kari, Jarkko (ed.) et al., Unveiling dynamics and complexity. 13th conference on computability in Europe, CiE 2017, Turku, Finland, June 12–16, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10307, 270-281 (2017). MSC: 68R10 05C15 05C60 68Q17 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Lect. Notes Comput. Sci. 10307, 270--281 (2017; Zbl 1489.68192) Full Text: DOI arXiv Link
Đapić, Petar; Marković, Petar; Martin, Barnaby Quantified constraint satisfaction problem on semicomplete digraphs. (English) Zbl 1367.68115 ACM Trans. Comput. Log. 18, No. 1, Article No. 2, 47 p. (2017). MSC: 68Q25 05C20 05C85 68Q17 PDFBibTeX XMLCite \textit{P. Đapić} et al., ACM Trans. Comput. Log. 18, No. 1, Article No. 2, 47 p. (2017; Zbl 1367.68115) Full Text: DOI Link
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
Golovach, Petr A.; Lidický, Bernard; Martin, Barnaby; Paulusma, Daniël Finding vertex-surjective graph homomorphisms. (English) Zbl 1253.68149 Acta Inf. 49, No. 6, 381-394 (2012). MSC: 68Q17 05C60 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Acta Inf. 49, No. 6, 381--394 (2012; Zbl 1253.68149) Full Text: DOI Link
Golovach, Petr A.; Paulusma, Daniël; Song, Jian Computing vertex-surjective homomorphisms to partially reflexive trees. (English) Zbl 1251.05031 Theor. Comput. Sci. 457, 86-100 (2012). MSC: 05C05 05C60 68Q17 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theor. Comput. Sci. 457, 86--100 (2012; Zbl 1251.05031) Full Text: DOI
Bodirsky, Manuel; Kára, Jan; Martin, Barnaby The complexity of surjective homomorphism problems-a survey. (English) Zbl 1246.05104 Discrete Appl. Math. 160, No. 12, 1680-1690 (2012). MSC: 05C60 68Q17 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., Discrete Appl. Math. 160, No. 12, 1680--1690 (2012; Zbl 1246.05104) Full Text: DOI
Golovach, Petr A.; Paulusma, Daniël; Song, Jian Computing vertex-surjective homomorphisms to partially reflexive trees. (English) Zbl 1332.68073 Kulikov, Alexander (ed.) et al., Computer science – theory and applications. 6th international computer science symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14–18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20711-2/pbk). Lecture Notes in Computer Science 6651, 261-274 (2011). MSC: 68Q25 05C05 05C60 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Lect. Notes Comput. Sci. 6651, 261--274 (2011; Zbl 1332.68073) Full Text: DOI Link