Decomposing 10-regular graphs into paths of length 5
From MaRDI portal
Recommendations
- Decomposing 2k-regular graphs into paths of length k
- scientific article; zbMATH DE number 1334640
- Decomposition of (2k + 1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k + 1
- Decompositions of triangle-free 5-regular graphs into paths of length five
- Decomposition of \(4k\)-regular graphs into \(k\, 4\)-regular \(K_5\)-free and \((K_5\text{-}e)\)-free subgraphs
Cites work
- scientific article; zbMATH DE number 4150219 (Why is no real title available?)
- scientific article; zbMATH DE number 1334640 (Why is no real title available?)
- Decomposing 8-regular graphs into paths of length 4
- Decomposing regular graphs with prescribed girth into paths of given length
- Decomposing the cube into paths
- Decomposition of Cartesian products of regular graphs into isomorphic trees
- Decompositions of regular bipartite graphs
- On decomposing regular graphs into isomorphic double-stars
- On the decomposition of n‐cubes into isomorphic trees
Cited in
(2)
This page was built for publication: Decomposing 10-regular graphs into paths of length 5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158191)