Embedding a subclass of trees into hypercubes

DOI10.1016/j.disc.2011.02.011zbMath1223.05020OpenAlexW2046583134MaRDI QIDQ534055

S. Lavanya, Sheshayya A. Choudum

Publication date: 10 May 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.02.011

zbMATH Keywords

hypercubeembeddingcaterpillarspanning subgraph

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dense sets and embedding binary trees into hypercubes
• On embedding subclasses of height-balanced trees in hypercubes
• Embedding height balanced trees and Fibonacci trees in hypercubes
• Embedding ladders and caterpillars into the hypercube
• On Hamiltonian circuits and spanning trees of hypercubes
• Embedding Trees in a Hypercube is NP-Complete
• One-legged caterpillars span hypercubes
• Embedding $m$-quasistars into $n$-cubes
• On cubes and dichotomic trees
• Spanning caterpillars of a hypercube
• $B$-valuations of graphs
• Disjoint paths in hypercubes with prescribed origins and lengths
• Optimal embeddings of generalized ladders into hypercubes
• Optimal embeddings of odd ladders into a hypercube