Abstract
Beineke, Harary, and Ringel discovered a formula for the minimum genus of a torus in which the n-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 n, the entire 2-skeleton decomposes into copies of the surface, and the intersection of any two copies is the hypercube graph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The American mathematical monthly : the official journal of the Mathematical Association of America
Paper Title
Journal
Date
