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

DOI10.1007/S10587-015-0165-6zbMATH Open1363.05030OpenAlexW2012001646MaRDI QIDQ5249653FDOQ5249653

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

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

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

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

Cited In (1)

• 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)