On Oriented Embedding of the Binary Tree into the Hypercube

DOI10.1017/S0963548300000948MaRDI QIDQ4306429zbMATH OpenFDO

Authors Sergej L. Bezrukov

Publication date 19 September 1994

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548300000948

zbMATH Keywords

hypercubeoriented embeddingstreeupper bound

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35)

Recommendations

• Compact embedding of binary trees into hypercubes
• Optimal dynamic embeddings of complete binary trees into hypercubes
• Embedding complete binary trees into hypercubes
• scientific article; zbMATH DE number 4064517
• Dense edge-disjoint embedding of complete binary trees in the hypercube

Cited in

(7)

• Spanning multi-paths in hypercubes
• Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
• Embedding binary trees into crossed cubes
• Oriented hypercubes
• A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
• Embedding complete trees into the hypercube
• Compact embedding of binary trees into hypercubes

This page was built for publication: On Oriented Embedding of the Binary Tree into the Hypercube

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