Multidecomposition of hypercube graphs into paths, cycles and stars
From MaRDI portal
Cites work
- Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars
- Decomposing the hypercube Q_n into n isomorphic edge-disjoint trees
- Décomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens
- 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 graphs into paths and stars with different number of edges
- Decomposition of hypercube graphs into paths and cycles of length four
- Decomposition of product graphs into paths and cycles of length four
- 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
- Edge decompositions of hypercubes by paths and by cycles
- Graph theory with applications
- scientific article; zbMATH DE number 4173021 (Why is no real title available?)
- scientific article; zbMATH DE number 1026076 (Why is no real title available?)
- Multi-decomposition of graphs into paths and Y-trees of order five
- Multidecompositions of several graph products
- Symmetric edge-decompositions of hypercubes
- Über drei kombinatorische Probleme am \(n\)-dimensionalen Würfel und Würfelgitter
This page was built for publication: Multidecomposition of hypercube graphs into paths, cycles and stars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6921015)