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
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
Dross, François; Foucaud, Florent; Mitsou, Valia; Ochem, Pascal; Pierron, Théo Complexity of planar signed graph homomorphisms to cycles. (English) Zbl 1443.05084 Discrete Appl. Math. 284, 166-178 (2020). MSC: 05C22 05C38 05C60 68Q17 PDFBibTeX XMLCite \textit{F. Dross} et al., Discrete Appl. Math. 284, 166--178 (2020; Zbl 1443.05084) Full Text: DOI arXiv
Chudnovsky, Maria; Huang, Shenwei; Rzążewski, Paweł; Spirkl, Sophie; Zhong, Mingxian Complexity of \(C_K\)-coloring in hereditary classes of graphs. (English) Zbl 07525468 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 31, 15 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 31, 15 p. (2019; Zbl 07525468) 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
Chaplick, Steven; Fiala, Jiří; van ’t Hof, Pim; Paulusma, Daniël; Tesař, Marek Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. (English) Zbl 1430.68122 Theor. Comput. Sci. 590, 86-95 (2015). MSC: 68Q25 05C60 68Q17 PDFBibTeX XMLCite \textit{S. Chaplick} et al., Theor. Comput. Sci. 590, 86--95 (2015; Zbl 1430.68122) 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
Roberson, David E. Häggkvist-Hell graphs: A class of Kneser-colorable graphs. (English) Zbl 1237.05087 Discrete Math. 312, No. 5, 837-853 (2012). MSC: 05C15 05C69 PDFBibTeX XMLCite \textit{D. E. Roberson}, Discrete Math. 312, No. 5, 837--853 (2012; Zbl 1237.05087) Full Text: DOI arXiv
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
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
Nešetřil, Jaroslav; Ossona de Mendez, Patrice Cuts and bounds. (English) Zbl 1076.05089 Discrete Math. 302, No. 1-3, 211-224 (2005). MSC: 05E99 05C83 05C15 05C99 06A06 06A07 PDFBibTeX XMLCite \textit{J. Nešetřil} and \textit{P. Ossona de Mendez}, Discrete Math. 302, No. 1--3, 211--224 (2005; Zbl 1076.05089) Full Text: DOI
Šparl, Petra; Žerovnik, Janez Homomorphisms of hexagonal graphs to odd cycles. (English) Zbl 1042.05054 Discrete Math. 283, No. 1-3, 273-277 (2004). MSC: 05C38 05C15 PDFBibTeX XMLCite \textit{P. Šparl} and \textit{J. Žerovnik}, Discrete Math. 283, No. 1--3, 273--277 (2004; Zbl 1042.05054) Full Text: DOI
Díaz, Josep; Serna, Maria; Thilikos, Dimitrios M. Counting \(H-\)colorings of partial \(k-\)trees. (English) Zbl 0996.68132 Theor. Comput. Sci. 281, No. 1-2, 291-309 (2002). MSC: 68R10 PDFBibTeX XMLCite \textit{J. Díaz} et al., Theor. Comput. Sci. 281, No. 1--2, 291--309 (2002; Zbl 0996.68132) Full Text: DOI