Decomposing 10-regular graphs into paths of length 5

DOI10.7151/DMGT.2334MaRDI QIDQ2158191zbMATH OpenOpenAlexFDO

Authors Mengmeng Xie, Chuixiang Zhou

Publication date 26 July 2022

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

10-regular graphbalanced decomposition

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)

Review text

It is proved that every 10-regular graph which does not contain any 4-cycles can be decomposed into paths of length 5, such that every vertex is a terminal of exactly two paths. Such decomposition is called balanced.

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

• 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
• scientific article; zbMATH DE number 4150219 (Why is no real title available?)
• scientific article; zbMATH DE number 1334640 (Why is no real title available?)
• On decomposing regular graphs into isomorphic double-stars
• On the decomposition of n‐cubes into isomorphic trees

Cited in

(2)

• Decomposing 2k-regular graphs into paths of length k
• Decomposition of \(4k\)-regular graphs into \(k\, 4\)-regular \(K_5\)-free and \((K_5\text{-}e)\)-free subgraphs

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)