Bulatov, Andrei A.; Živný, Stanislav Approximate counting CSP seen from the other side. (English) Zbl 1499.68238 Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 60, 14 p. (2019). MSC: 68R07 08A70 68Q25 68Q27 PDFBibTeX XMLCite \textit{A. A. Bulatov} and \textit{S. Živný}, LIPIcs -- Leibniz Int. Proc. Inform. 138, Article 60, 14 p. (2019; Zbl 1499.68238) Full Text: DOI arXiv
Habib, Michel; Mamcarz, Antoine; de Montgolfier, Fabien Computing \(H\)-joins with application to 2-modular decomposition. (English) Zbl 1306.05235 Algorithmica 70, No. 2, 245-266 (2014). MSC: 05C85 PDFBibTeX XMLCite \textit{M. Habib} et al., Algorithmica 70, No. 2, 245--266 (2014; Zbl 1306.05235) 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
Monti, A.; Sinaimeri, B. Rainbow graph splitting. (English) Zbl 1225.68137 Theor. Comput. Sci. 412, No. 39, 5315-5324 (2011). MSC: 68R10 68Q25 05C15 05C70 PDFBibTeX XMLCite \textit{A. Monti} and \textit{B. Sinaimeri}, Theor. Comput. Sci. 412, No. 39, 5315--5324 (2011; Zbl 1225.68137) 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
Esperet, Louis; Montassier, Mickaël; Zhu, Xuding Adapted list coloring of planar graphs. (English) Zbl 1221.05136 J. Graph Theory 62, No. 2, 127-138 (2009). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{L. Esperet} et al., J. Graph Theory 62, No. 2, 127--138 (2009; Zbl 1221.05136) Full Text: DOI
Montassier, Mickaël; Raspaud, André; Zhu, Xuding An upper bound on adaptable choosability of graphs. (English) Zbl 1209.05094 Eur. J. Comb. 30, No. 2, 351-355 (2009). MSC: 05C15 05C78 05C35 PDFBibTeX XMLCite \textit{M. Montassier} et al., Eur. J. Comb. 30, No. 2, 351--355 (2009; Zbl 1209.05094) 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
Hell, Pavol; Zhu, Xuding On the adaptable chromatic number of graphs. (English) Zbl 1147.05031 Eur. J. Comb. 29, No. 4, 912-921 (2008). MSC: 05C15 PDFBibTeX XMLCite \textit{P. Hell} and \textit{X. Zhu}, Eur. J. Comb. 29, No. 4, 912--921 (2008; Zbl 1147.05031) Full Text: DOI
Feder, Tomás; Hell, Pavol; Xie, Wing Matrix partitions with finitely many obstructions. (English) Zbl 1158.05325 Hliněný, Petr (ed.) et al., 6th Czech-Slovak international symposium on combinatorics, graph theory, algorithms and applications, DIMATIA Center, Charles University, Prague, Czech Republic, July 10–16, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 28, 371-378 (2007). MSC: 05C50 15A99 05C75 PDFBibTeX XMLCite \textit{T. Feder} et al., Electron. Notes Discrete Math. 28, 371--378 (2007; Zbl 1158.05325) 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