Decomposition of hypercubes into regular connected bipancyclic subgraphs
From MaRDI portal
Recommendations
Cites work
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Connectivity of Cartesian products of graphs
- Decomposing the cube into paths
- Decomposing the hypercube Q_n into n isomorphic edge-disjoint trees
- Edge decompositions of hypercubes by paths and by cycles
- Edge-bipancyclicity of a hypercube with faulty vertices and edges
- Hamilton Decompositions and (n/2)-Factorizations of Hypercubes
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- Regular connected bipancyclic spanning subgraphs of hypercubes
- Symmetric edge-decompositions of hypercubes
Cited in
(14)- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- Decomposition of the product of cycles based on degree partition
- Long path and cycle decompositions of even hypercubes
- Factorizations of the product of cycles
- Edge decompositions of hypercubes by paths and by cycles
- Regular connected bipancyclic spanning subgraphs of hypercubes
- On 3-regular bipancyclic subgraphs of hypercubes
- scientific article; zbMATH DE number 7478578 (Why is no real title available?)
- Regular connected bipancyclic spanning subgraphs of torus networks
- Decomposition of hypercube graphs into paths and cycles of length four
- Cycle decompositions of the Cartesian product of cycles
- Decomposing hypercubes into regular connected subgraphs
- On 4-regular 4-connected bipancyclic subgraphs of hypercubes
- Decomposing complete graphs into cubes
This page was built for publication: Decomposition of hypercubes into regular connected bipancyclic subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3451073)