I will discuss recent results classifying the complexity of list homomorphism and of minimum cost homomorphism problems, by certain combinatorial conditions. These conditions in turn suggest interesting classes of graphs and especially of digraphs, analogous to well studied graph classes such as interval and unit interval graphs. These results are joint with Arash Rafiey, Tomas Feder, and Huang Jing.