Minimal mesh embeddings in binary hypercubes

DOI10.1109/12.5990MaRDI QIDQ3806842zbMATH OpenOpenAlexFDO

Authors David S. Scott, Joe Brandenburg

Publication date 1988

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.5990

zbMATH Keywords

hypercubesmeshesminimal graph embeddingssubgraph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(2)

• Optimal gray-code labeling and recognition algorithms for hypercubes
• Embeddings on a Boolean cube

This page was built for publication: Minimal mesh embeddings in binary hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3806842)