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
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
Alon, Noga; Shapira, Asaf Testing subgraphs in directed graphs. (English) Zbl 1084.68087 J. Comput. Syst. Sci. 69, No. 3, 354-382 (2004). MSC: 68R10 05C20 PDFBibTeX XMLCite \textit{N. Alon} and \textit{A. Shapira}, J. Comput. Syst. Sci. 69, No. 3, 354--382 (2004; Zbl 1084.68087) Full Text: DOI
Borodin, O. V.; Kostochka, A. V.; Nešetřil, J.; Raspaud, A.; Sopena, E. On universal graphs for planar oriented graphs of a given girth. (English) Zbl 0956.05041 Discrete Math. 188, No. 1-3, 73-85 (1998). MSC: 05C15 05C20 PDFBibTeX XMLCite \textit{O. V. Borodin} et al., Discrete Math. 188, No. 1--3, 73--85 (1998; Zbl 0956.05041) Full Text: DOI
Nešetřil, Jarik; Raspaud, André; Sopena, Eric Colorings and girth of oriented planar graphs. (English) Zbl 0873.05042 Discrete Math. 165-166, 519-530 (1997). Reviewer: J.Bang-Jensen (Odense) MSC: 05C15 05C20 PDFBibTeX XMLCite \textit{J. Nešetřil} et al., Discrete Math. 165--166, 519--530 (1997; Zbl 0873.05042) Full Text: DOI
Hell, Pavol; Nešetřil, Jaroslav; Zhu, Xuding Complexity of tree homomorphisms. (English) Zbl 0868.05018 Discrete Appl. Math. 70, No. 1, 23-36 (1996). Reviewer: P.Kirschenhofer (Leoben) MSC: 05C05 68R10 05C15 05C38 PDFBibTeX XMLCite \textit{P. Hell} et al., Discrete Appl. Math. 70, No. 1, 23--36 (1996; Zbl 0868.05018) Full Text: DOI Link
Bačík, Roman; Mahajan, Sanjeev Semidefinite programming and its applications to NP problems. (English) Zbl 1527.68150 Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 1st international conference, COCOON ’95, Xi’an, China, August 24–26, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 959, 566-575 (1995). MSC: 68R10 68Q25 90C22 PDFBibTeX XMLCite \textit{R. Bačík} and \textit{S. Mahajan}, Lect. Notes Comput. Sci. 959, 566--575 (1995; Zbl 1527.68150) Full Text: DOI