The problem of counting all H-colorings of a graph G of n vertices is considered. While the problem is, in general #P-complete, we give linear time algorithms that solve the main variants of this problem when the input ...