Hell, Pavol; Nešetřil, Jaroslav Graph homomorphisms. (English) Zbl 07636087 Beineke, Lowell W. (ed.) et al., Topics in algorithmic graph theory. Cambridge: Cambridge University Press. Encycl. Math. Appl. 178, 262-293 (2021). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Encycl. Math. Appl. 178, 262--293 (2021; Zbl 07636087) Full Text: DOI Link
Hell, Pavol; Nešetřil, Jaroslav In praise of homomorphisms. (English) Zbl 1506.08001 Comput. Sci. Rev. 40, Article ID 100352, 5 p. (2021). MSC: 08A05 08-03 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Comput. Sci. Rev. 40, Article ID 100352, 5 p. (2021; Zbl 1506.08001) 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; Nešetřil, Jarik On the density of trigraph homomorphisms. (English) Zbl 1120.05091 Graphs Comb. 23, Suppl., 275-281 (2007). Reviewer: William G. Brown (Montréal) MSC: 05C99 05C15 05C17 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Graphs Comb. 23, 275--281 (2007; Zbl 1120.05091) Full Text: DOI
Hell, Pavol; Nešetřil, Jaroslav Counting list homomorphisms for graphs with bounded degrees. (English) Zbl 1059.05049 Nešetřil, J. (ed.) et al., Graphs, morphisms and statistical physics. Proceedings of the workshop held at Rutgers University, Piscataway, NJ, USA, March 19–21, 2001. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-3551-3/hbk). DIMACS. Series in Discrete Mathematics and Theoretical Computer Science 63, 105-112 (2004). Reviewer: Ian M. Wanless (Darwin) MSC: 05C15 05C85 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 63, 105--112 (2004; Zbl 1059.05049)
Hell, Pavol; Nešetřil, Jaroslav Graphs and homomorphisms. (English) Zbl 1062.05139 Oxford Lecture Series in Mathematics and its Applications 28. Oxford: Oxford University Press (ISBN 0-19-852817-5/hbk). xii, 244 p. (2004). Reviewer: Mark E. Watkins (Syracuse) MSC: 05C99 05C15 05C20 05C62 06A07 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Graphs and homomorphisms. Oxford: Oxford University Press (2004; Zbl 1062.05139)
Hell, P.; Nešetřil, J.; Raspaud, A.; Sopena, E. Three-and-more set theorems. (English) Zbl 1045.05086 Commentat. Math. Univ. Carol. 41, No. 4, 793-801 (2000). Reviewer: Jiří Matoušek (Praha) MSC: 05D05 PDFBibTeX XMLCite \textit{P. Hell} et al., Commentat. Math. Univ. Carol. 41, No. 4, 793--801 (2000; Zbl 1045.05086) Full Text: EuDML
Galluccio, Anna; Hell, Pavol; Nešetřil, Jaroslav The complexity of \(H\)-colouring of bounded degree graphs. (English) Zbl 0956.05036 Discrete Math. 222, No. 1-3, 101-109 (2000). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C15 68R10 PDFBibTeX XMLCite \textit{A. Galluccio} et al., Discrete Math. 222, No. 1--3, 101--109 (2000; Zbl 0956.05036) 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
Hell, Pavol; Nešetřil, Jaroslav; Zhu, Xuding Duality and polynomial testing of tree homomorphisms. (English) Zbl 0877.05055 Trans. Am. Math. Soc. 348, No. 4, 1281-1297 (1996). MSC: 05C85 68Q25 05C15 05C20 PDFBibTeX XMLCite \textit{P. Hell} et al., Trans. Am. Math. Soc. 348, No. 4, 1281--1297 (1996; Zbl 0877.05055) Full Text: DOI
Hell, Pavol; Nešetřil, J.; Zhu, Xuding Duality of graph homomorphisms. (English) Zbl 0846.05093 Miklós, D. (ed.) et al., Combinatorics, Paul Erdős is eighty. Vol. 2. Budapest: János Bolyai Mathematical Society. Bolyai Soc. Math. Stud. 2, 271-282 (1996). Reviewer: R.Bodendiek (Kiel) MSC: 05C99 05C05 05C38 05C20 PDFBibTeX XMLCite \textit{P. Hell} et al., Bolyai Soc. Math. Stud. 2, 271--282 (1996; Zbl 0846.05093)
Hell, Pavol; Nešetřil, Jaroslav The core of a graph. (English) Zbl 0803.68080 Discrete Math. 109, No. 1-3, 117-126 (1992). Reviewer: J.Bang-Jensen (Odense) MSC: 68R10 68Q25 05C75 05C15 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Discrete Math. 109, No. 1--3, 117--126 (1992; Zbl 0803.68080) Full Text: DOI
Hell, Pavol; Nešetřil, Jaroslav Images of rigid digraphs. (English) Zbl 0715.05027 Eur. J. Comb. 12, No. 1, 33-42 (1991). Reviewer: J.W.Moon MSC: 05C20 05C75 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Eur. J. Comb. 12, No. 1, 33--42 (1991; Zbl 0715.05027) Full Text: DOI
Hell, Pavol; Nešetřil, Jaroslav On the complexity of H-coloring. (English) Zbl 0639.05023 J. Comb. Theory, Ser. B 48, No. 1, 92-110 (1990). Reviewer: P.Hell MSC: 05C15 68R10 68Q25 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, J. Comb. Theory, Ser. B 48, No. 1, 92--110 (1990; Zbl 0639.05023) Full Text: DOI
Hell, Pavol; Nešetřil, Jaroslav Universality of directed graphs of a given height. (English) Zbl 0712.05033 Arch. Math., Brno 25, No. 1-2, 47-54 (1989). Reviewer: J.W.Moon MSC: 05C20 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Arch. Math., Brno 25, No. 1--2, 47--54 (1989; Zbl 0712.05033) Full Text: EuDML
Hell, Pavol; Nešetřil, Jaroslav The existence problem for graph homomorphisms. (English) Zbl 0673.05033 Graph theory in memory of G. A. Dirac, Pap. Meet., Sandbjerg/Den. 1985, Ann. Discrete Math. 41, 255-265 (1989). Reviewer: M.Skoviera MSC: 05C15 PDFBibTeX XML
Hell, Pavol; Nešetřil, Jaroslav On the complexity of H-coloring. (English) Zbl 0622.05025 Combinatorics, graph theory, and computing, Proc. 17th Southeast. Conf., Boca Raton/Fl. 1986, Congr. Numerantium 55, 284 (1986). Reviewer: G.Slutzki MSC: 05C15 68R10 PDFBibTeX XML
Hell, Pavol; Nešetřil, Jaroslav Cohomomorphisms of graphs and hypergraphs. (English) Zbl 0435.05050 Math. Nachr. 87, 53-61 (1979). MSC: 05C99 05C25 05C65 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Math. Nachr. 87, 53--61 (1979; Zbl 0435.05050) Full Text: DOI
Hell, Pavol; Nešetřil, Jaroslav On the edge-sets of rigid and corigid graphs. (English) Zbl 0424.05034 Math. Nachr. 87, 63-69 (1979). MSC: 05C25 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Math. Nachr. 87, 63--69 (1979; Zbl 0424.05034) Full Text: DOI
Hell, Pavel; Nešetřil, Jaroslav Homomorphisms of graphs and of their orientations. (English) Zbl 0375.05023 Monatsh. Math. 85, 39-48 (1978). MSC: 05C10 05C99 05C20 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Monatsh. Math. 85, 39--48 (1978; Zbl 0375.05023) Full Text: DOI EuDML
Hell, Pavol; Nešetřil, Jaroslav Groups and monoids of regular graphs (and of graphs with bounded degrees). (English) Zbl 0253.05126 Can. J. Math. 25, 239-251 (1973). MSC: 05C25 20B25 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Can. J. Math. 25, 239--251 (1973; Zbl 0253.05126) Full Text: DOI
Chvátal, Václav; Hell, Pavol; Kučera, L.; Nešetřil, Jaroslav Every finite graph is a full subgraph of a rigid graph. (English) Zbl 0231.05107 J. Comb. Theory, Ser. B 11, 284-286 (1971). MSC: 05C10 PDFBibTeX XMLCite \textit{V. Chvátal} et al., J. Comb. Theory, Ser. B 11, 284--286 (1971; Zbl 0231.05107) Full Text: DOI
Nešetřil, Jaroslav; Hell, Pavol \(k\)-societies with given semigroup. (English) Zbl 0254.08002 Combinat. Struct. Appl., Proc. Calgary internat. Conf. combinat. Struct. Appl., Calgary 1969, 301-302 (1970). MSC: 08A05 05C25 05C99 PDFBibTeX XML
Hell, Pavol; Nešetřil, Jaroslav Rigid and inverse-rigid graphs. (English) Zbl 0247.05137 Combinat. Struct. Appl., Proc. Calgary internat. Conf. combinat. Struct. Appl., Calgary 1969, 169-171 (1970). MSC: 05C25 05C35 05C99 PDFBibTeX XML
Hell, Pavol; Nešetřil, Jaroslav Graphs and k-societies. (English) Zbl 0209.32201 Can. Math. Bull. 13, 375-381 (1970). MSC: 05C99 18B99 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Can. Math. Bull. 13, 375--381 (1970; Zbl 0209.32201) Full Text: DOI