The following problem has been known since the 80's. Let Γ be an Abelian group of order m (denoted |Γ| = m), and let t and {m i } t i=1 , be positive integers such that t i=1 m i = m − 1. Determine when Γ * = Γ \ {0}, the set of non-zero elements of Γ, can be partitioned into disjoint subsets {S i } t i=1 such that |S i | = m i and s∈Si s = 0 for all i, 1 ≤ i ≤ t. Such subset partitions are called zero-sum partitions.|I(Γ)| = 1, where I(Γ) is the set of involutions of Γ, is a necessary condition for the existence of zero-sum partitions. In this paper we show that the condition: m i ≥ 4 for all i, 1 ≤ i ≤ t, is sufficient. Moreover, we present some applications of zero-sum partitions to irregular, magic-and anti-magic-type labelings of graphs.