Decomposing regular graphs with prescribed girth into paths of given length

DOI10.1016/J.EJC.2017.06.011MaRDI QIDQ2403689zbMATH OpenOpenAlexFDO

Authors F. Botler, G. O. Mota, Yoshiko Wakabayashi, M. T. I. Oshiro

Publication date 11 September 2017

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2017.06.011

zbMATH Keywords

\(P_\ell\)-decomposition of a graph

Mathematics Subject Classification ID

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

Recommendations

• Path decompositions of regular graphs with prescribed girth
• 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
• Decomposition of 8-regular graphs into paths of length 4
• Regular path decompositions of odd regular graphs

Cites work

• scientific article; zbMATH DE number 4150219 (Why is no real title available?)
• scientific article; zbMATH DE number 1334640 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• Decomposing 8-regular graphs into paths of length 4
• Decomposing highly edge-connected graphs into paths of any given length
• Decomposing the cube into paths
• Decomposition of Cartesian products of regular graphs into isomorphic trees
• Decompositions of highly connected graphs into paths of length five
• Decompositions of regular bipartite graphs
• Decompositions of triangle-free 5-regular graphs into paths of length five
• From the theory of regular graphs of third and fourth degree
• Graph theory
• On the decomposition of n‐cubes into isomorphic trees
• P4-decompositions of regular graphs
• Regular path decompositions of odd regular graphs
• Trois Types De Décompositions D'un Graphe En Chaînes

Cited in

(12)

• Regular path decompositions of odd regular graphs
• Decomposition of (2k + 1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k + 1
• Decomposing 8-regular graphs into paths of length 4
• Path decompositions of regular graphs with prescribed girth
• Decompositions of highly connected graphs into paths of any given length
• Decomposing highly edge-connected graphs into paths of any given length
• Decompositions of 6-regular bipartite graphs into paths of length six
• Decomposing 10-regular graphs into paths of length 5
• Decomposition of 8-regular graphs into paths of length 4
• Decomposing highly connected graphs into paths of length five
• Decomposing 2k-regular graphs into paths of length k
• Decompositions of triangle-free 5-regular graphs into paths of length five

This page was built for publication: Decomposing regular graphs with prescribed girth into paths of given length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2403689)