Disjoint cycles and spanning graphs of hypercubes

DOI10.1016/j.disc.2004.08.005zbMath1057.05049OpenAlexW1973555886MaRDI QIDQ704283

Mohamed Kobeissi, Michel Mollard

Publication date: 13 January 2005

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

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

zbMATH Keywords

HypercubeCyclesMD-graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes ⋮ Embedding double starlike trees into hypercubes ⋮ The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube ⋮ On the equitable \(k^{*}\)-laceability of hypercubes ⋮ Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs ⋮ Characterizing which powers of hypercubes and folded hypercubes are divisor graphs

Cites Work

• Unnamed Item
• The starlike trees which span a hypercube
• Spanning graphs of hypercubes: Starlike and double starlike trees
• On Hamiltonian circuits and spanning trees of hypercubes
• Embedding $m$-quasistars into $n$-cubes

This page was built for publication: Disjoint cycles and spanning graphs of hypercubes