Decomposing 8-regular graphs into paths of length 4
From MaRDI portal
Publication:2359970
Recommendations
- Decomposition of 8-regular graphs into paths of length 4
- Decomposing 2k-regular graphs into paths of length k
- Decomposition of (2k + 1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k + 1
- On path decompositions of \(2 k\)-regular graphs
- Path decompositions of regular graphs with prescribed girth
Cites work
- A survey of graceful trees
- Decomposing highly edge-connected graphs into paths of any given length
- 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
- scientific article; zbMATH DE number 4150219 (Why is no real title available?)
- scientific article; zbMATH DE number 3458691 (Why is no real title available?)
- scientific article; zbMATH DE number 1334640 (Why is no real title available?)
- scientific article; zbMATH DE number 3308125 (Why is no real title available?)
- On the decomposition of n‐cubes into isomorphic trees
Cited in
(6)- Decomposition of 8-regular graphs into paths of length 4
- Decomposition of (2k + 1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k + 1
- Decomposing 10-regular graphs into paths of length 5
- Decomposing 2k-regular graphs into paths of length k
- Decomposing regular graphs with prescribed girth into paths of given length
- Decompositions of 6-regular bipartite graphs into paths of length six
This page was built for publication: Decomposing 8-regular graphs into paths of length 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359970)