Abstract: This paper presents the number of combinatorially distinct rooted Eulerian planar maps with the number of non-root-vertices and the number of non-root-faces as two parameters. The parametric expressions for determining the number in the loopless Eulerian case are also obtained.