Decomposing 8-regular graphs into paths of length 4
From MaRDI portal
Publication:2359970
DOI10.1016/j.disc.2017.04.024zbMath1365.05225OpenAlexW2963144802MaRDI QIDQ2359970
Publication date: 23 June 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.04.024
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items
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\) ⋮ Decompositions of 6-regular bipartite graphs into paths of length six ⋮ Decomposing regular graphs with prescribed girth into paths of given length
Cites Work
- Decomposing highly edge-connected graphs into paths of any given length
- Decomposing the cube into paths
- Decompositions of regular bipartite graphs
- Decomposing regular graphs with prescribed girth into paths of given length
- Decomposition of Cartesian products of regular graphs into isomorphic trees
- On the decomposition of n‐cubes into isomorphic trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item