...core of a graph. Discrete Math., 109(1-3):117-126, 1992. Algebraic graph theory (Leibnitz, 1989). 414. P. Hell, J. Nesetfil, and X. Zhu. Duality and polynomial testing of tree homomorphisms. Trans. Amer. Math. Soc., 348(4):1281-1297, 1996. 415. P. Hell and M. Rosenfeld. The complexity of finding...

...Nesetfil. On the complexity of H-coloring. Journal of Combinatorial Theory, Series B, 48:92-110, 1990. 21. P. Hell, J. Nesetfil, and X. Zhu. Duality and polynomial testing of tree homomorphisms. Trans. Amer. Math. Soc., 348(4):1281-1297, 1996. 22. W. Hodges. A shorter model theory. Cambridge University...

...press. [57] P. Hell and J. Nesetfil, Graphs and Homomorphisms, Clarendon Press, Oxford (2003). [58] P. Hell, J. Nesetfil and X. Zhu, Duality and polynomial testing of tree homomorphisms, Trans. Amer. Math. Soc. 348 (1996), 147-156. [59] P. Hell, J. Nesetfil and X. Zhu, Complexity of tree...