Before revision:  In this paper we present partitioning algorithms for cactus graphs to show that these partition problems are polynomial-time solvable for this graph class as well .
After revision:  In this paper , we present a polynomial-time algorithm for cactus graphs to show that these partition problems are polynomial-time solvable for this graph class as well .