A Unification of Two Refinements of Euler's Partition Theorem
  We obtain a unification of two refinements of Euler's partition theorem respectively due to Bessenrodt and Glaisher. A specialization of Bessenrodt's insertion algorithm for a generalization of the Andrews-Olsson partition identity is used in our combinatorial construction. 
William Y. C. Chen, Henry Y. Gao, Kathy Q. Ji and Martin Y. X. Li