Decomposition of Cartesian products of regular graphs into isomorphic trees
From MaRDI portal
Publication:2449976
Recommendations
- scientific article; zbMATH DE number 1556732
- On decomposing even regular multigraphs into small isomorphic trees
- Graph decompositions for cartesian products
- Decompositions of graphs into trees
- Decompositions of graphs into trees, forests, and regular subgraphs
- Tree decompositions for a class of graphs
- Tree decompositions of multigraphs
- Decomposition of complete graphs into arbitrary trees
- Isomorphic decomposition of complete graphs into linear forests
- scientific article; zbMATH DE number 169203
Cited in
(12)- Decomposing 10-regular graphs into paths of length 5
- Decomposing 2k-regular graphs into paths of length k
- On decomposing regular graphs into isomorphic double-stars
- Decompositions of triangle-free 5-regular graphs into paths of length five
- Decomposing 8-regular graphs into paths of length 4
- Decomposing regular graphs with prescribed girth into paths of given length
- On decomposing even regular multigraphs into small isomorphic trees
- Path decompositions of regular graphs with prescribed girth
- scientific article; zbMATH DE number 1556732 (Why is no real title available?)
- On the decomposition of n‐cubes into isomorphic trees
- Gregarious \(Y_5\)-tree decompositions of tensor product of complete graphs
- Decomposition of a complete equipartite graph into gregarious \(\mathcal{Y}_5\) tree
This page was built for publication: Decomposition of Cartesian products of regular graphs into isomorphic trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2449976)
