Spanning caterpillars of a hypercube

DOI10.1002/(SICI)1097-0118(199701)24:1%3C9::AID-JGT2%3E3.0.CO;2-VzbMATH Open0865.05034OpenAlexW4249275203MaRDI QIDQ5284591FDOQ5284591

Authors Tomáš Dvořák, Michel Mollard, Ivan Havel, Jean-Marie Laborde 

Publication date 29 June 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199701)24:1%3C9::aid-jgt2%3E3.0.co;2-v

zbMATH Keywords

treehypercubepathcaterpillar

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Recommendations

• Spanning regular caterpillars in hypercubes
• One-legged caterpillars span hypercubes
• 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 graphs of hypercubes: Starlike and double starlike trees

Cited in

(10)

• Embedding a subclass of trees into hypercubes
• The caterpillar-packing polytope
• Title not available (Why is no real title available?)
• Embedding multidimensional grids into optimal hypercubes
• Optimal embeddings of odd ladders into a hypercube
• Spanning multi-paths in hypercubes
• Title not available (Why is no real title available?)
• Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs
• One-legged caterpillars span hypercubes
• Embedding ladders and caterpillars into the hypercube

This page was built for publication: Spanning caterpillars of a hypercube

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