Bodirsky, Manuel; Bulín, Jakub; Starke, Florian; Wernthaler, Michael The smallest hard trees. (English) Zbl 1521.05019 Constraints 28, No. 2, 105-137 (2023). MSC: 05C05 05C60 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., Constraints 28, No. 2, 105--137 (2023; Zbl 1521.05019) Full Text: DOI arXiv
Bodirsky, Manuel; Starke, Florian; Vucaj, Albert Smooth digraphs modulo primitive positive constructability and cyclic loop conditions. (English) Zbl 1502.08004 Int. J. Algebra Comput. 31, No. 5, 929-967 (2021). MSC: 08A40 05C20 08B05 05C38 08A70 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., Int. J. Algebra Comput. 31, No. 5, 929--967 (2021; Zbl 1502.08004) Full Text: DOI arXiv
Bulín, Jakub On the complexity of \(\mathbb{H}\)-coloring for special oriented trees. (English) Zbl 1376.05049 Eur. J. Comb. 69, 54-75 (2018). MSC: 05C15 05C05 05C20 PDFBibTeX XMLCite \textit{J. Bulín}, Eur. J. Comb. 69, 54--75 (2018; Zbl 1376.05049) Full Text: DOI arXiv
Đ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
Valadkhan, Payam The complexity of list edge-partitions for simple graphs. (English) Zbl 1352.05154 Eur. J. Comb. 61, 219-234 (2017). MSC: 05C70 PDFBibTeX XMLCite \textit{P. Valadkhan}, Eur. J. Comb. 61, 219--234 (2017; Zbl 1352.05154) Full Text: DOI
Kun, Gábor; Szegedy, Mario A new line of attack on the dichotomy conjecture. (English) Zbl 1327.05183 Eur. J. Comb. 52, Part B, 338-367 (2016). MSC: 05C40 68Q17 PDFBibTeX XMLCite \textit{G. Kun} and \textit{M. Szegedy}, Eur. J. Comb. 52, Part B, 338--367 (2016; Zbl 1327.05183) Full Text: DOI
Wires, Alexander Dichotomy for finite tournaments of mixed-type. (English) Zbl 1318.05033 Discrete Math. 338, No. 12, 2523-2538 (2015). MSC: 05C20 PDFBibTeX XMLCite \textit{A. Wires}, Discrete Math. 338, No. 12, 2523--2538 (2015; Zbl 1318.05033) Full Text: DOI
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
Kearnes, Keith; Marković, Petar; McKenzie, Ralph Optimal strong Mal’cev conditions for omitting type 1 in locally finite varieties. (English) Zbl 1305.08008 Algebra Univers. 72, No. 1, 91-100 (2014). Reviewer: Ivan Chajda (Přerov) MSC: 08B05 08A40 08A62 PDFBibTeX XMLCite \textit{K. Kearnes} et al., Algebra Univers. 72, No. 1, 91--100 (2014; Zbl 1305.08008) 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
Vikas, Narayan Algorithms for partition of some class of graphs under compaction and vertex-compaction. (English) Zbl 1275.05057 Algorithmica 67, No. 2, 180-206 (2013). MSC: 05C85 05C70 68Q17 PDFBibTeX XMLCite \textit{N. Vikas}, Algorithmica 67, No. 2, 180--206 (2013; Zbl 1275.05057) Full Text: DOI
MacGillivray, Gary; Swarts, Jacobus The \(C_{k}\)-extended graft construction. (English) Zbl 1223.05300 Discrete Appl. Math. 159, No. 12, 1293-1301 (2011). MSC: 05C85 05C20 05C30 05C31 PDFBibTeX XMLCite \textit{G. MacGillivray} and \textit{J. Swarts}, Discrete Appl. Math. 159, No. 12, 1293--1301 (2011; Zbl 1223.05300) Full Text: DOI
Trotta, Belinda Residual properties of pre-bipartite digraphs. (English) Zbl 1225.05120 Algebra Univers. 64, No. 1-2, 161-186 (2010). MSC: 05C20 05C70 PDFBibTeX XMLCite \textit{B. Trotta}, Algebra Univers. 64, No. 1--2, 161--186 (2010; Zbl 1225.05120) Full Text: DOI
Foniok, Jan; Nešetřil, Jaroslav; Pultr, Aleš; Tardif, Claude Dualities and dual pairs in Heyting algebras. (English) Zbl 1206.06004 Order 27, No. 3, 327-342 (2010). Reviewer: Radomír Halaš (Prostejov) MSC: 06D20 05C60 18B35 PDFBibTeX XMLCite \textit{J. Foniok} et al., Order 27, No. 3, 327--342 (2010; Zbl 1206.06004) Full Text: DOI arXiv Link
Erdős, Péter L.; Soukup, Lajos No finite-infinite antichain duality in the homomorphism poset of directed graphs. (English) Zbl 1223.05094 Order 27, No. 3, 317-325 (2010). Reviewer: Michael Hager (Leonberg) MSC: 05C20 06A06 PDFBibTeX XMLCite \textit{P. L. Erdős} and \textit{L. Soukup}, Order 27, No. 3, 317--325 (2010; Zbl 1223.05094) Full Text: DOI
Nešetřil, Jaroslav A surprising permanence of old motivations (a not-so-rigid story). (English) Zbl 1183.01032 Discrete Math. 309, No. 18, 5510-5526 (2009). Reviewer: Antonín Slavík (Praha) MSC: 01A70 05-02 05-03 05C75 PDFBibTeX XMLCite \textit{J. Nešetřil}, Discrete Math. 309, No. 18, 5510--5526 (2009; Zbl 1183.01032) Full Text: DOI
Barto, Libor; Kozik, Marcin; Maróti, Miklós; Niven, Todd CSP dichotomy for special triads. (English) Zbl 1215.05179 Proc. Am. Math. Soc. 137, No. 9, 2921-2934 (2009). MSC: 05C85 PDFBibTeX XMLCite \textit{L. Barto} et al., Proc. Am. Math. Soc. 137, No. 9, 2921--2934 (2009; Zbl 1215.05179) Full Text: DOI
Kowalczyk, Michael Classification of a class of counting problems using holographic reductions. (English) Zbl 1248.68208 Ngo, Hung Q. (ed.), Computing and combinatorics. 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13–15, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02881-6/pbk). Lecture Notes in Computer Science 5609, 472-485 (2009). MSC: 68Q15 05C30 68Q25 PDFBibTeX XMLCite \textit{M. Kowalczyk}, Lect. Notes Comput. Sci. 5609, 472--485 (2009; Zbl 1248.68208) 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
Kun, Gábor; Nešetřil, Jaroslav Forbidden lifts (NP and CSP for combinatorialists). (English) Zbl 1213.68323 Eur. J. Comb. 29, No. 4, 930-945 (2008). MSC: 68Q19 03C13 05C15 68Q15 PDFBibTeX XMLCite \textit{G. Kun} and \textit{J. Nešetřil}, Eur. J. Comb. 29, No. 4, 930--945 (2008; Zbl 1213.68323) Full Text: DOI arXiv
Foniok, Jan; Nešetřil, Jaroslav; Tardif, Claude Generalised dualities and maximal finite antichains in the homomorphism order of relational structures. (English) Zbl 1147.05037 Eur. J. Comb. 29, No. 4, 881-899 (2008). Reviewer: Wai-Kai Chen (Fremont) MSC: 05C20 05C05 PDFBibTeX XMLCite \textit{J. Foniok} et al., Eur. J. Comb. 29, No. 4, 881--899 (2008; Zbl 1147.05037) Full Text: DOI Link
Atserias, Albert On digraph coloring problems and treewidth duality. (English) Zbl 1160.05024 Eur. J. Comb. 29, No. 4, 796-820 (2008). MSC: 05C20 05C15 05C75 PDFBibTeX XMLCite \textit{A. Atserias}, Eur. J. Comb. 29, No. 4, 796--820 (2008; Zbl 1160.05024) Full Text: DOI
Bulatov, Andrei A.; Dalmau, Víctor Towards a dichotomy theorem for the counting constraint satisfaction problem. (English) Zbl 1115.68141 Inf. Comput. 205, No. 5, 651-678 (2007). MSC: 68T20 68Q25 PDFBibTeX XMLCite \textit{A. A. Bulatov} and \textit{V. Dalmau}, Inf. Comput. 205, No. 5, 651--678 (2007; Zbl 1115.68141) Full Text: DOI Link
Hubička, Jan; Nešetřil, Jaroslav Finite paths are universal. (English) Zbl 1092.06002 Order 22, No. 1, 21-40 (2005). Reviewer: Jiří Rachůnek (Olomouc) MSC: 06A06 06A07 05C38 PDFBibTeX XMLCite \textit{J. Hubička} and \textit{J. Nešetřil}, Order 22, No. 1, 21--40 (2005; Zbl 1092.06002) Full Text: DOI
Bulatov, Andrei; Grohe, Martin The complexity of partition functions. (English) Zbl 1081.68030 Theor. Comput. Sci. 348, No. 2-3, 148-186 (2005). MSC: 68Q25 05C15 68R10 68T20 PDFBibTeX XMLCite \textit{A. Bulatov} and \textit{M. Grohe}, Theor. Comput. Sci. 348, No. 2--3, 148--186 (2005; Zbl 1081.68030) Full Text: DOI
Hubička, Jan; Nešetřil, Jaroslav Universal partial order represented by means of oriented trees and other simple graphs. (English) Zbl 1060.05092 Eur. J. Comb. 26, No. 5, 765-778 (2005). MSC: 05C99 PDFBibTeX XMLCite \textit{J. Hubička} and \textit{J. Nešetřil}, Eur. J. Comb. 26, No. 5, 765--778 (2005; Zbl 1060.05092) Full Text: DOI
Hubička, J.; Nešetřil, J. Finite paths are universal. (English) Zbl 1079.06002 Order 21, No. 3, 181-200 (2004). MSC: 06A06 06A07 05C38 PDFBibTeX XMLCite \textit{J. Hubička} and \textit{J. Nešetřil}, Order 21, No. 3, 181--200 (2004; Zbl 1079.06002) Full Text: DOI
Klostermeyer, William F.; MacGillivray, Gary Homomorphisms and oriented colorings of equivalence classes of oriented graphs. (English) Zbl 1032.05047 Discrete Math. 274, No. 1-3, 161-172 (2004). MSC: 05C15 68R10 05C20 PDFBibTeX XMLCite \textit{W. F. Klostermeyer} and \textit{G. MacGillivray}, Discrete Math. 274, No. 1--3, 161--172 (2004; Zbl 1032.05047) Full Text: DOI
Nešetřil, Jaroslav; Tardif, Claude Density via duality. (English) Zbl 1058.05062 Theor. Comput. Sci. 287, No. 2, 585-591 (2002). MSC: 05C99 68R10 PDFBibTeX XMLCite \textit{J. Nešetřil} and \textit{C. Tardif}, Theor. Comput. Sci. 287, No. 2, 585--591 (2002; Zbl 1058.05062) Full Text: DOI
Nešetřil, Jaroslav; Tardif, Claude Duality theorems for finite structures (characterising gaps and good characterisations). (English) Zbl 1024.05078 J. Comb. Theory, Ser. B 80, No. 1, 80-97 (2000). MSC: 05C75 08A02 68R05 PDFBibTeX XMLCite \textit{J. Nešetřil} and \textit{C. Tardif}, J. Comb. Theory, Ser. B 80, No. 1, 80--97 (2000; Zbl 1024.05078) Full Text: DOI Link
Hochstättler, Winfried; Nešetřil, Jaroslav A note on maxflow-mincut and homomorphic equivalence in matroids. (English) Zbl 0966.05015 J. Algebr. Comb. 12, No. 3, 295-300 (2000). MSC: 05B35 PDFBibTeX XMLCite \textit{W. Hochstättler} and \textit{J. Nešetřil}, J. Algebr. Comb. 12, No. 3, 295--300 (2000; Zbl 0966.05015) 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
Feder, Tomas; Hell, Pavol List homomorphisms to reflexive graphs. (English) Zbl 0904.05078 J. Comb. Theory, Ser. B 72, No. 2, 236-250 (1998). Reviewer: P.Hell (Burnaby, BC) MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{T. Feder} and \textit{P. Hell}, J. Comb. Theory, Ser. B 72, No. 2, 236--250 (1998; Zbl 0904.05078) 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