 Polygonal-schema Euler count

Identifying the $2n$ sides of one polygon in pairs gives a cell structure with one face, $n$ edges and some number $V$ of vertex classes. For a closed orientable surface of genus $g$,Since $V\ge 1$, every such schema satisfies $n\ge 2g$.