Decomposition of hypercube graphs into paths and cycles having k edges
From MaRDI portal
Publication:6938249
Cites work
- \(K_n( \lambda )\) is fully \(\{P_5,C_6\}\)-decomposable
- A survey of the theory of hypercube graphs
- Cycle decompositions of the Cartesian product of cycles
- Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars
- Decomposition of Cartesian product of complete graphs into paths and stars with four edges
- Decomposition of complete bipartite graphs into cycles and stars with four edges
- Decomposition of complete bipartite graphs into paths and cycles
- Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges
- Decomposition of complete tripartite graphs into cycles and paths of length three
- Decomposition of hypercube graphs into paths and cycles of length four
- Decomposition of product graphs into paths and cycles of length four
- Decomposition of product graphs into paths and stars on five vertices
- Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each
- Decompositions of complete graphs into paths and cycles.
- Edge decompositions of hypercubes by paths
- scientific article; zbMATH DE number 1026076 (Why is no real title available?)
- Long path and cycle decompositions of even hypercubes
- Multidecompositions of several graph products
This page was built for publication: Decomposition of hypercube graphs into paths and cycles having k edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6938249)