Path decompositions of regular graphs with prescribed girth

DOI10.1016/J.ENDM.2015.06.085zbMath1346.05132OpenAlexW2276833181MaRDI QIDQ322341

Marcio T. I. Oshiro, Yoshiko Wakabayashi, Fábio Botler, Guilherme Oliveira Mota

Publication date: 14 October 2016

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

zbMATH Keywords

regular graphsgirthpath decompositionedge decomposition

Mathematics Subject Classification ID

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

Related Items (4)

Decompositions of highly connected graphs into paths of any given length ⋮ On path decompositions of \(2 k\)-regular graphs ⋮ Decomposing highly connected graphs into paths of length five ⋮ Decompositions of triangle-free 5-regular graphs into paths of length five

Cites Work

• 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
• Decomposition of Cartesian products of regular graphs into isomorphic trees
• From the theory of regular graphs of third and fourth degree
• Trois Types De Décompositions D'un Graphe En Chaînes
• Regular path decompositions of odd regular graphs
• P4-decompositions of regular graphs
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• Claw‐decompositions and tutte‐orientations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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