A note on the cubical dimension of new classes of binary trees.

DOI10.1007/S10587-015-0165-6MaRDI QIDQ5249653zbMATH OpenOpenAlexFDO

Authors Kamal Kabyl, Abdelhafid Berrachedi, Éric Sopena

Publication date 6 May 2015

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10338.dmlcz/144218

zbMATH Keywords

cubical dimensionembeddingHavel's conjecturehypercube

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• scientific article; zbMATH DE number 3936535
• Embedding a subclass of trees into hypercubes
• Cubical graphs and cubical dimensions
• Embedding complete trees into the hypercube
• Embedding complete binary trees into hypercubes

Cites work

• B-valuations of graphs
• Compact embedding of binary trees into hypercubes
• Dense sets and embedding binary trees into hypercubes
• Embedding a subclass of trees into hypercubes
• Embedding height balanced trees and Fibonacci trees in hypercubes
• Embedding ladders and caterpillars into the hypercube
• Embedding the dichotomic tree into the n-cube
• Embedding Trees in a Hypercube is NP-Complete
• scientific article; zbMATH DE number 4132179 (Why is no real title available?)
• On Hamiltonian circuits and spanning trees of hypercubes
• Spanning graphs of hypercubes: Starlike and double starlike trees
• Two new classes of trees embeddable into hypercubes

Cited in

(2)

• Certain AVL subgraphs of ternary cubes
• Optimal embeddings of generalized ladders into hypercubes

This page was built for publication: A note on the cubical dimension of new classes of binary trees.

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