Counting the number of vertex covers: when is it hard? Posted by Walter Bishop, at cstheory.stackexchange.com, 12 Feb 2011 Consider the #P-complete problem of counting the number of vertex covers of a given graph $G = (V, E)$. I'd like to know if…