Abstract

Beineke, Harary and Ringel discovered a formula for the minimum genus of a torus in which the nn-dimensional hypercube graph can be embedded. We give a new proof of the formula by building this surface as a union of certain faces in the hypercube's 2-skeleton. For odd dimension nn, the entire 2-skeleton decomposes into (n−1)/2(n-1)/2 copies of the surface, and the intersection of any two copies is the hypercube graph.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.