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

DOI10.1007/s10587-015-0165-6zbMath1363.05030OpenAlexW2012001646MaRDI QIDQ5249653

Eric Sopena, Abdelhafid Berrachedi, Kamal Kabyl

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

hypercubeembeddingcubical dimensionHavel's conjecture

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Embedding a subclass of trees into hypercubes
• Compact embedding of binary trees into hypercubes
• Dense sets and embedding binary trees into hypercubes
• Embedding height balanced trees and Fibonacci trees in hypercubes
• Spanning graphs of hypercubes: Starlike and double starlike trees
• Embedding ladders and caterpillars into the hypercube
• On Hamiltonian circuits and spanning trees of hypercubes
• Embedding Trees in a Hypercube is NP-Complete
• Embedding the dichotomic tree into the $n$-cube
• $B$-valuations of graphs
• Two new classes of trees embeddable into hypercubes

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