Orientable Hamiltonian Embeddings of the Hypercube Graph

2020/01/26 by Leyland, Richard
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2001.09383

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.

Related

• Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
• Matchings in Hypercubes Extend to Long Cycles
• A New Property of Hamilton Graphs
• Locally Hamiltonian graphs and minimal size of maximal graphs on a surface
• Hamiltonian cycles in some family of cubic 3-connected plane graphs