One-legged caterpillars span hypercubes

DOI10.1002/JGT.3190100110MaRDI QIDQ3717071zbMATH OpenOpenAlexFDO

Authors Petr Liebl, Ivan 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)

Recommendations

• scientific article; zbMATH DE number 4132179
• Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube
• Spanning regular caterpillars in hypercubes
• Spanning caterpillars of a hypercube
• Embedding ladders and caterpillars into the hypercube

Cited in

(15)

• Embedding a subclass of trees into hypercubes
• Two new classes of trees embeddable into hypercubes
• The starlike trees which span a hypercube
• On embedding subclasses of height-balanced trees in hypercubes
• Spanning subgraphs of a hypercube iii: meshes
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• scientific article; zbMATH DE number 4132179 (Why is no real title available?)
• A survey of the theory of hypercube graphs
• Spanning multi-paths in hypercubes
• Optimal embeddings of odd ladders into a hypercube
• Graphs with all diametral paths through distant central nodes
• Spanning subgraphs of a hypercube. IV: Rooted trees
• Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs
• Embedding ladders and caterpillars into the hypercube
• Optimal embeddings of generalized ladders into hypercubes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3717071)