One-legged caterpillars span hypercubes

DOI10.1002/JGT.3190100110zbMath0589.05031OpenAlexW2154874082MaRDI QIDQ3717071

Petr Liebl, Ivan M. Havel

Publication date: 1986

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190100110

zbMATH Keywords

hypercubecaterpillar

Mathematics Subject Classification ID

Trees (05C05)

Related Items (13)

Spanning multi-paths in hypercubes ⋮ The starlike trees which span a hypercube ⋮ A survey of the theory of hypercube graphs ⋮ Hyper-Hamilton laceable and caterpillar-spannable product graphs ⋮ Embedding ladders and caterpillars into the hypercube ⋮ Two new classes of trees embeddable into hypercubes ⋮ Embedding a subclass of trees into hypercubes ⋮ Optimal embeddings of odd ladders into a hypercube ⋮ On embedding subclasses of height-balanced trees in hypercubes ⋮ Spanning subgraphs of a hypercube iii: meshes ⋮ Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs ⋮ Graphs with all diametral paths through distant central nodes ⋮ Spanning subgraphs of a hypercube. IV: Rooted trees

This page was built for publication: One-legged caterpillars span hypercubes