  We prove that, for the edge ideal of a graph whose cycles are pairwise
vertex-disjoint, the arithmetical rank is bounded above by the sum of the
number of cycles and the maximum height of its associated primes.
