In this work, we establish two interesting partition identities involving the minimal odd excludant, which has attracted great attention in recent years. In particular, we find a strong refinement of Euler's celebrated theorem that the number of partitions of an integer into odd parts equals the number of partitions of that integer into distinct parts.