Path bundles on n-cubes

DOI10.1016/J.DISC.2007.07.006MaRDI QIDQ932673zbMATH OpenOpenAlexFDO

Authors Matt Elder

Publication date 11 July 2008

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graph partitionGray code\(n\)-cubebinary wordspath bundle

Mathematics Subject Classification ID

Applications of graph theory (05C90) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Path partitions of hypercubes
• Path coverings with prescribed ends of the \(n\)-dimensional binary hypercube
• Publication:3204492
• Decomposing the cube into paths
• On path bipancyclicity of hypercubes

Cites work

• A Survey of Combinatorial Gray Codes
• Antipodal Gray codes

Cited in

(1)

• Homology of spaces of directed paths on Euclidean cubical complexes

This page was built for publication: Path bundles on \(n\)-cubes

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