Let and be two sequences of nonnegative integers satisfying , for , and implies that for . Let be a subset of and for each . is said to be partial parity graphic with respect to if there exists a simple graph with vertices , such that for and for each . In this paper, we give a characterization for to be partial parity graphic. This is a variation of the partial parity -factor theorem due to Kano and Matsuda in degree sequences.