On path decompositions of \(2k\)-regular graphs

DOI10.1016/j.endm.2015.07.028zbMath1347.05101arXiv1510.02526OpenAlexW2783442670MaRDI QIDQ324765

Andrea Jiménez, Fábio Botler

Publication date: 17 October 2016

Full work available at URL: https://arxiv.org/abs/1510.02526

zbMATH Keywords

regular graphslength-constrainedpath decompositions

Mathematics Subject Classification ID

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

Related Items

On path decompositions of \(2 k\)-regular graphs ⋮ Gallai's path decomposition conjecture for graphs of small maximum degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Path decomposition of graphs with given path length
• Path decompositions and Gallai's conjecture
• Covering the edges of a connected graph by paths
• Decompositions of triangle-free 5-regular graphs into paths of length five
• Decomposing graphs into paths of fixed length
• From the theory of regular graphs of third and fourth degree
• Regular path decompositions of odd regular graphs
• An upper bound for the path number of a graph
• Gallai's Conjecture For Graphs of Girth at Least Four