Path decompositions of regular graphs with prescribed girth

DOI10.1016/J.ENDM.2015.06.085MaRDI QIDQ322341zbMATH OpenOpenAlexFDO

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

Publication date 14 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2015.06.085

zbMATH Keywords

girthregular graphspath decompositionedge decomposition

Mathematics Subject Classification ID

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

Recommendations

• Decomposing regular graphs with prescribed girth into paths of given length
• Path decomposition of graphs with given path length
• On path decompositions of \(2 k\)-regular graphs
• Regular path decompositions of odd regular graphs
• On path decompositions of \(2k\)-regular graphs
• Decompositions of highly connected graphs into paths of any given length
• Decomposing 2k-regular graphs into paths of length k
• Decomposing graphs into paths of fixed length
• Path decompositions and Gallai's conjecture
• A result on decompositions of regular graphs

Cites work

• scientific article; zbMATH DE number 3726401 (Why is no real title available?)
• scientific article; zbMATH DE number 46958 (Why is no real title available?)
• scientific article; zbMATH DE number 47528 (Why is no real title available?)
• scientific article; zbMATH DE number 1334640 (Why is no real title available?)
• scientific article; zbMATH DE number 554067 (Why is no real title available?)
• Claw‐decompositions and tutte‐orientations
• Decomposition of Cartesian products of regular graphs into isomorphic trees
• Decompositions of highly connected graphs into paths of any given length
• 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 Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• Graph theory
• 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

(11)

• Graph decompositions and \(D_3\)-paths with a prescribed endvertex
• 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
• Decompositions of highly connected graphs into paths of any given length
• Path decomposition of graphs with given path length
• Decomposition of 8-regular graphs into paths of length 4
• Decomposing highly connected graphs into paths of length five
• Decompositions of triangle-free 5-regular graphs into paths of length five
• On path decompositions of \(2 k\)-regular graphs
• Decomposing regular graphs with prescribed girth into paths of given length

This page was built for publication: Path decompositions of regular graphs with prescribed girth

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