Decomposing 10-regular graphs into paths of length 5

DOI10.7151/DMGT.2334zbMATH Open1502.05208OpenAlexW3033946714MaRDI QIDQ2158191FDOQ2158191

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

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

zbMATH Keywords

balanced decomposition10-regular graph

Mathematics Subject Classification ID

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

Cites Work

• 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
• Title not available (Why is that?)
• On the decomposition of n‐cubes into isomorphic trees
• Title not available (Why is that?)
• Decomposing the cube into paths
• On decomposing regular graphs into isomorphic double-stars
• Decomposing 8-regular graphs into paths of length 4

Cited In (1)

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

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)