Optimal embeddings of odd ladders into a hypercube

DOI10.1016/S0166-218X(00)00329-2zbMath1005.05016WikidataQ126988785 ScholiaQ126988785MaRDI QIDQ5957299

Václav Koubek, Rostislav Caha

Publication date: 3 July 2002

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (3)

Spanning multi-paths in hypercubes ⋮ Dense sets and embedding binary trees into hypercubes ⋮ Embedding a subclass of trees into hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• Spanning regular caterpillars in hypercubes
• Embedding ladders and caterpillars into the hypercube
• One-legged caterpillars span hypercubes
• On cubes and dichotomic trees
• Spanning caterpillars of a hypercube

This page was built for publication: Optimal embeddings of odd ladders into a hypercube