scientific article; zbMATH DE number 1472115

zbMATH Open0952.05020MaRDI QIDQ4489166FDOQ4489166

Authors: Dajin Wang 

Publication date: 14 January 2001

Title of this publication is not available (Why is that?)

Recommendations

• Complete binary trees in folded and enhanced cubes
• Embedding complete binary trees into hypercubes
• Dense edge-disjoint embedding of complete binary trees in the hypercube
• Compact embedding of binary trees into hypercubes
• Dense sets and embedding binary trees into hypercubes

zbMATH Keywords

hypercubeembeddingcomplete binary tree

Mathematics Subject Classification ID

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

Cited In (7)

• Compact embedding of binary trees into hypercubes
• Embedding binary trees into crossed cubes
• A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
• Title not available (Why is that?)
• Complete binary trees in folded and enhanced cubes
• A note on embeddings among folded hypercubes, even graphs and odd graphs
• Title not available (Why is that?)

This page was built for publication:

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