Kim, Hyobeen; Siggers, Mark Towards a dichotomy for the list switch homomorphism problem for signed graphs. (English) Zbl 07796796 Kyungpook Math. J. 63, No. 3, 355-372 (2023). MSC: 05C15 05C85 PDFBibTeX XMLCite \textit{H. Kim} and \textit{M. Siggers}, Kyungpook Math. J. 63, No. 3, 355--372 (2023; Zbl 07796796) Full Text: DOI
Heo, Cheolwon; Kim, Hyobin; Mark, Siggers The complexity of the matroid homomorphism problem. (English) Zbl 1516.05021 Electron. J. Comb. 30, No. 2, Research Paper P2.28, 17 p. (2023). MSC: 05B35 52B40 68Q25 PDFBibTeX XMLCite \textit{C. Heo} et al., Electron. J. Comb. 30, No. 2, Research Paper P2.28, 17 p. (2023; Zbl 1516.05021) Full Text: DOI
Chudnovsky, Maria; Huang, Shenwei; Rzążewski, Paweł; Spirkl, Sophie; Zhong, Mingxian Complexity of \(C_k\)-coloring in hereditary classes of graphs. (English) Zbl 07687210 Inf. Comput. 292, Article ID 105015, 19 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., Inf. Comput. 292, Article ID 105015, 19 p. (2023; Zbl 07687210) Full Text: DOI
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
Bhyravarapu, Sriram; Jana, Satyabrata; Panolan, Fahad; Saurabh, Saket; Verma, Shaily List homomorphism: beyond the known boundaries. (English) Zbl 07719369 Castañeda, Armando (ed.) et al., Latin 2022: theoretical informatics. 15th Latin American symposium, Guanajuato, Mexico, November 7–11, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13568, 593-609 (2022). MSC: 68Qxx 68Rxx 68Wxx PDFBibTeX XMLCite \textit{S. Bhyravarapu} et al., Lect. Notes Comput. Sci. 13568, 593--609 (2022; Zbl 07719369) Full Text: DOI
Bok, Jan; Brewster, Richard C.; Hell, Pavol; Jedličková, Nikola; Rafiey, Arash Min orderings and list homomorphism dichotomies for signed and unsigned graphs. (English) Zbl 07719364 Castañeda, Armando (ed.) et al., Latin 2022: theoretical informatics. 15th Latin American symposium, Guanajuato, Mexico, November 7–11, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13568, 510-526 (2022). MSC: 68Qxx 68Rxx 68Wxx PDFBibTeX XMLCite \textit{J. Bok} et al., Lect. Notes Comput. Sci. 13568, 510--526 (2022; Zbl 07719364) Full Text: DOI arXiv
Bok, Jan; Brewster, Richard; Feder, Tomás; Hell, Pavol; Jedličková, Nikola List homomorphisms to separable signed graphs. (English) Zbl 07683160 Balachandran, Niranjan (ed.) et al., Algorithms and discrete applied mathematics. 8th international conference, CALDAM 2022, Puducherry, India, February 10–12, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13179, 22-35 (2022). MSC: 68Wxx PDFBibTeX XMLCite \textit{J. Bok} et al., Lect. Notes Comput. Sci. 13179, 22--35 (2022; Zbl 07683160) Full Text: DOI
Chudnovsky, Maria; King, Jason; Pilipczuk, Michał; Rzążewski, Paweł; Spirkl, Sophie Finding large \(H\)-colorable subgraphs in hereditary graph classes. (English) Zbl 1478.05048 SIAM J. Discrete Math. 35, No. 4, 2357-2386 (2021). Reviewer: Vahan Mkrtchyan (L’Aquila) MSC: 05C15 05C85 68Q25 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., SIAM J. Discrete Math. 35, No. 4, 2357--2386 (2021; Zbl 1478.05048) Full Text: DOI arXiv
Okrasa, Karolina; Rzążewski, Paweł Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs. (English) Zbl 1511.68126 SIAM J. Comput. 50, No. 2, 487-508 (2021). MSC: 68Q25 05C60 05C85 68Q27 68R10 PDFBibTeX XMLCite \textit{K. Okrasa} and \textit{P. Rzążewski}, SIAM J. Comput. 50, No. 2, 487--508 (2021; Zbl 1511.68126) Full Text: DOI arXiv
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
Okrasa, Karolina; Piecyk, Marta; Rzążewski, Paweł Full complexity classification of the list homomorphism problem for bounded-treewidth graphs. (English) Zbl 07651213 Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 74, 24 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{K. Okrasa} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 74, 24 p. (2020; Zbl 07651213) Full Text: DOI arXiv
Bok, Jan; Brewster, Richard; Feder, Tomás; Hell, Pavol; Jedličková, Nikola List homomorphism problems for signed graphs. (English) Zbl 07559391 Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 20, 14 p. (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Bok} et al., LIPIcs -- Leibniz Int. Proc. Inform. 170, Article 20, 14 p. (2020; Zbl 07559391) Full Text: DOI arXiv
Hell, Pavol; Huang, Jing; McConnell, Ross M.; Rafiey, Arash Min-orderable digraphs. (English) Zbl 1450.05036 SIAM J. Discrete Math. 34, No. 3, 1710-1724 (2020). MSC: 05C20 05C75 05C62 05C17 PDFBibTeX XMLCite \textit{P. Hell} et al., SIAM J. Discrete Math. 34, No. 3, 1710--1724 (2020; Zbl 1450.05036) Full Text: DOI
Feder, Tomás; Hell, Pavol Complexity of correspondence \(H\)-colourings. (English) Zbl 1440.05150 Discrete Appl. Math. 281, 235-245 (2020). MSC: 05C60 05C15 68Q17 PDFBibTeX XMLCite \textit{T. Feder} and \textit{P. Hell}, Discrete Appl. Math. 281, 235--245 (2020; Zbl 1440.05150) 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
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
Valadkhan, Payam; Davari, Mohammad-Javad The monotonicity property of \(M\)-partition problems. (English) Zbl 1384.05134 Eur. J. Comb. 70, 178-189 (2018). MSC: 05C70 68Q25 PDFBibTeX XMLCite \textit{P. Valadkhan} and \textit{M.-J. Davari}, Eur. J. Comb. 70, 178--189 (2018; Zbl 1384.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
Jerrum, Mark Counting constraint satisfaction problems. (English) Zbl 1482.68164 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, 205-231 (2017). MSC: 68R07 68Q25 68W25 PDFBibTeX XMLCite \textit{M. Jerrum}, Dagstuhl Follow-Ups 7, 205--231 (2017; Zbl 1482.68164) Full Text: DOI
Feder, Tomás; Hell, Pavol Correspondence homomorphisms to reflexive graphs. (English) Zbl 1383.05212 Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 9-14 (2017). MSC: 05C60 05C15 68Q25 PDFBibTeX XMLCite \textit{T. Feder} and \textit{P. Hell}, Electron. Notes Discrete Math. 62, 9--14 (2017; Zbl 1383.05212) 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
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
Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. Parameterized algorithms for min-max multiway cut and list digraph homomorphism. (English) Zbl 1370.68131 J. Comput. Syst. Sci. 86, 191-206 (2017). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{E. J. Kim} et al., J. Comput. Syst. Sci. 86, 191--206 (2017; Zbl 1370.68131) Full Text: DOI Link
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
Brewster, Richard C.; Foucaud, Florent; Hell, Pavol; Naserasr, Reza The complexity of signed graph and edge-coloured graph homomorphisms. (English) Zbl 1351.05099 Discrete Math. 340, No. 2, 223-235 (2017). MSC: 05C22 05C15 05C60 PDFBibTeX XMLCite \textit{R. C. Brewster} et al., Discrete Math. 340, No. 2, 223--235 (2017; Zbl 1351.05099) Full Text: DOI arXiv
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; Nevisi, Mayssam Mohammadi Minimum cost homomorphisms with constrained costs. (English) Zbl 1476.68110 Dinh, Thang N. (ed.) et al., Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2–4, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9797, 194-206 (2016). MSC: 68Q25 05C60 68Q17 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{M. M. Nevisi}, Lect. Notes Comput. Sci. 9797, 194--206 (2016; Zbl 1476.68110) Full Text: DOI arXiv
Bulatov, Andrei A. Conservative constraint satisfaction re-revisited. (English) Zbl 1346.68108 J. Comput. Syst. Sci. 82, No. 2, 347-356 (2016). MSC: 68Q25 PDFBibTeX XMLCite \textit{A. A. Bulatov}, J. Comput. Syst. Sci. 82, No. 2, 347--356 (2016; Zbl 1346.68108) Full Text: DOI arXiv
Göbel, Andreas; Goldberg, Leslie Ann; McQuillan, Colin; Richerby, David; Yamakami, Tomoyuki Counting list matrix partitions of graphs. (English) Zbl 1329.68139 SIAM J. Comput. 44, No. 4, 1089-1118 (2015). MSC: 68Q25 05C30 05C50 68Q17 PDFBibTeX XMLCite \textit{A. Göbel} et al., SIAM J. Comput. 44, No. 4, 1089--1118 (2015; Zbl 1329.68139) Full Text: DOI arXiv
Bousquet, N.; Lagoutte, A.; Thomassé, S. Clique versus independent set. (English) Zbl 1297.05173 Eur. J. Comb. 40, 73-92 (2014). MSC: 05C69 68Q25 PDFBibTeX XMLCite \textit{N. Bousquet} et al., Eur. J. Comb. 40, 73--92 (2014; Zbl 1297.05173) 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
Larose, Benoît; Lemaître, Adrien List-homomorphism problems on graphs and arc consistency. (English) Zbl 1281.05069 Discrete Math. 313, No. 22, 2525-2537 (2013). MSC: 05C20 05C70 05C15 PDFBibTeX XMLCite \textit{B. Larose} and \textit{A. Lemaître}, Discrete Math. 313, No. 22, 2525--2537 (2013; Zbl 1281.05069) 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
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
Feder, Tomás; Hell, Pavol; Huang, Jing; Rafiey, Arash Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. (English) Zbl 1236.05092 Discrete Appl. Math. 160, No. 6, 697-707 (2012). MSC: 05C20 05C85 PDFBibTeX XMLCite \textit{T. Feder} et al., Discrete Appl. Math. 160, No. 6, 697--707 (2012; Zbl 1236.05092) Full Text: DOI
Feder, Tomás; Hell, Pavol; Schell, David G.; Stacho, Juraj Dichotomy for tree-structured trigraph list homomorphism problems. (English) Zbl 1223.05095 Discrete Appl. Math. 159, No. 12, 1217-1224 (2011). MSC: 05C20 05C15 05C05 05C60 PDFBibTeX XMLCite \textit{T. Feder} et al., Discrete Appl. Math. 159, No. 12, 1217--1224 (2011; Zbl 1223.05095) Full Text: DOI arXiv
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
Gutin, Gregory; Kim, Eun Jung The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops. (English) Zbl 1225.05113 Discrete Appl. Math. 158, No. 4, 319-330 (2010). MSC: 05C20 05C60 05C85 PDFBibTeX XMLCite \textit{G. Gutin} and \textit{E. J. Kim}, Discrete Appl. Math. 158, No. 4, 319--330 (2010; Zbl 1225.05113) Full Text: DOI
Feder, Tomás; Hell, Pavol; Huang, Jing; Rafiey, Arash Adjusted interval digraphs. (English) Zbl 1267.05257 Koster, Arie (ed.) et al., DIMAP workshop on algorithmic graph theory. Extended abstracts from the workshop held at the University of Warwick, Coventry, UK, March 23–25, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 32, 83-91 (2009). MSC: 05C85 05C20 PDFBibTeX XMLCite \textit{T. Feder} et al., Electron. Notes Discrete Math. 32, 83--91 (2009; Zbl 1267.05257) 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
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
Bulatov, Andrei A.; Krokhin, Andrei; Larose, Benoit Dualities for constraint satisfaction problems. (English) Zbl 1171.68494 Creignou, Nadia (ed.) et al., Complexity of constraints. An overview of current research themes. Berlin: Springer (ISBN 978-3-540-92799-0/pbk). Lecture Notes in Computer Science 5250, 93-124 (2008). MSC: 68Q25 03B70 08A70 PDFBibTeX XMLCite \textit{A. A. Bulatov} et al., Lect. Notes Comput. Sci. 5250, 93--124 (2008; Zbl 1171.68494) Full Text: DOI
Gutin, Gregory; Hell, Pavol; Rafiey, Arash; Yeo, Anders A dichotomy for minimum cost graph homomorphisms. (English) Zbl 1149.90164 Eur. J. Comb. 29, No. 4, 900-911 (2008). Reviewer: Rainer E. Burkard (Graz) MSC: 90C35 PDFBibTeX XMLCite \textit{G. Gutin} et al., Eur. J. Comb. 29, No. 4, 900--911 (2008; Zbl 1149.90164) Full Text: DOI
Dalmau, Víctor; Krokhin, Andrei Majority constraints have bounded pathwidth duality. (English) Zbl 1138.68052 Eur. J. Comb. 29, No. 4, 821-837 (2008). MSC: 68T20 68T27 PDFBibTeX XMLCite \textit{V. Dalmau} and \textit{A. Krokhin}, Eur. J. Comb. 29, No. 4, 821--837 (2008; Zbl 1138.68052) Full Text: DOI Link
Gupta, Arvind; Hell, Pavol; Karimi, Mehdi; Rafiey, Arash Minimum cost homomorphisms to reflexive digraphs. (English) Zbl 1136.68462 Laber, Eduardo Sany (ed.) et al., LATIN 2008: Theoretical informatics. 8th Latin American symposium, Búzios, Brazil, April 7–11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78772-3/pbk). Lecture Notes in Computer Science 4957, 182-193 (2008). MSC: 68R10 05C20 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. Gupta} et al., Lect. Notes Comput. Sci. 4957, 182--193 (2008; Zbl 1136.68462) Full Text: DOI arXiv
Golovach, Petr; Kratochvíl, Jan Computational complexity of generalized domination: A complete dichotomy for chordal graphs. (English) Zbl 1141.68530 Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 33rd international workshop, WG 2007, Dornburg, Germany, June 21–23, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-74838-0/pbk). Lecture Notes in Computer Science 4769, 1-11 (2007). MSC: 68R10 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{P. Golovach} and \textit{J. Kratochvíl}, Lect. Notes Comput. Sci. 4769, 1--11 (2007; Zbl 1141.68530) 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
Díaz, Josep; Serna, Maria; Thilikos, Dimitrios M. Complexity issues on bounded restrictive \(H\)-coloring. (English) Zbl 1119.05042 Discrete Math. 307, No. 16, 2082-2093 (2007). MSC: 05C15 68Q25 68R10 PDFBibTeX XMLCite \textit{J. Díaz} et al., Discrete Math. 307, No. 16, 2082--2093 (2007; Zbl 1119.05042) 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
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
Feder, Tomás; Hell, Pavol; Tucker-Nally, Kim Digraph matrix partitions and trigraph homomorphisms. (English) Zbl 1106.05060 Discrete Appl. Math. 154, No. 17, 2458-2469 (2006). MSC: 05C50 05C20 05C15 68R10 PDFBibTeX XMLCite \textit{T. Feder} et al., Discrete Appl. Math. 154, No. 17, 2458--2469 (2006; Zbl 1106.05060) 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
Huang, Jing Representation characterizations of chordal bipartite graphs. (English) Zbl 1095.05031 J. Comb. Theory, Ser. B 96, No. 5, 673-683 (2006). MSC: 05C75 PDFBibTeX XMLCite \textit{J. Huang}, J. Comb. Theory, Ser. B 96, No. 5, 673--683 (2006; Zbl 1095.05031) Full Text: DOI
Feder, Tomás; Hell, Pavol; Klein, Sulamita; Nogueira, Loana Tito; Protti, Fábio List matrix partitions of chordal graphs. (English) Zbl 1084.05026 Theor. Comput. Sci. 349, No. 1, 52-66 (2005). MSC: 05C15 05C70 68Q25 68R10 PDFBibTeX XMLCite \textit{T. Feder} et al., Theor. Comput. Sci. 349, No. 1, 52--66 (2005; Zbl 1084.05026) Full Text: DOI
Hell, Pavol; Huang, Jing A generalization of the theorem of Lekkerkerker and Boland. (English) Zbl 1073.05026 Discrete Math. 299, No. 1-3, 113-119 (2005). MSC: 05C15 05C75 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Huang}, Discrete Math. 299, No. 1--3, 113--119 (2005; Zbl 1073.05026) Full Text: DOI
Díaz, Josep; Serna, Maria; Thilikos, Dimitrios M. The restrictive \(H\)-coloring problem. (English) Zbl 1062.05055 Discrete Appl. Math. 145, No. 2, 297-305 (2005). Reviewer: Ján Plesník (Bratislava) MSC: 05C15 68R10 68Q17 PDFBibTeX XMLCite \textit{J. Díaz} et al., Discrete Appl. Math. 145, No. 2, 297--305 (2005; Zbl 1062.05055) Full Text: DOI
Jonsson, Peter; Krokhin, Andrei Recognizing frozen variables in constraint satisfaction problems. (English) Zbl 1086.68056 Theor. Comput. Sci. 329, No. 1-3, 93-113 (2004). MSC: 68Q25 68T20 PDFBibTeX XMLCite \textit{P. Jonsson} and \textit{A. Krokhin}, Theor. Comput. Sci. 329, No. 1--3, 93--113 (2004; Zbl 1086.68056) Full Text: DOI
Feder, Tomás; Madelaine, Florent; Stewart, Iain A. Dichotomies for classes of homomorphism problems involving unary functions. (English) Zbl 1070.68133 Theor. Comput. Sci. 314, No. 1-2, 1-43 (2004). MSC: 68T20 PDFBibTeX XMLCite \textit{T. Feder} et al., Theor. Comput. Sci. 314, No. 1--2, 1--43 (2004; Zbl 1070.68133) Full Text: DOI Link