Orientable Hamiltonian Embeddings of the Hypercube Graph

Abstract

A Hamiltonian embedding is an embedding of a graph $G$ such that the boundary of each face is a Hamiltonian cycle of $G$. It is shown that the hypercube graph $Q_n$ admits such an embedding on an orientable surface when $n$ is a power of 2. Basic necessary conditions on Hamiltonian embeddings for $Q_n$ and conjectures are made about other values of $n$.