2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/221266We 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.14 pages, 3 figures, the last version, to appear in The Ramanujan JournalCombinatoricsNumber Theorytext