Decomposing 10-regular graphs into paths of length 5

DOI10.7151/dmgt.2334zbMath1502.05208OpenAlexW3033946714MaRDI QIDQ2158191

Chuixiang Zhou, Mengmeng Xie

Publication date: 26 July 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2334

zbMATH Keywords

balanced decomposition10-regular graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items (1)

Decomposing \(2k\)-regular graphs into paths of length \(k\)

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposing the cube into paths
• Decompositions of regular bipartite graphs
• On decomposing regular graphs into isomorphic double-stars
• Decomposing 8-regular graphs into paths of length 4
• 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

This page was built for publication: Decomposing 10-regular graphs into paths of length 5