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

DOI10.1016/j.disc.2016.09.029zbMath1369.05167OpenAlexW2962972517MaRDI QIDQ2400577

Fábio Botler, Andrea Jiménez

Publication date: 29 August 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2016.09.029

zbMATH Keywords

perfect matchingspath decompositionlength-constrained\(2 k\)-regular graphs

Mathematics Subject Classification ID

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

Related Items

On computing the path number of a graph ⋮ Path decompositions of triangle-free graphs ⋮ An overview of graph covering and partitioning ⋮ Decompositions of 6-regular bipartite graphs into paths of length six ⋮ Gallai's conjecture for graphs with treewidth 3 ⋮ Gallai's conjecture on path decompositions ⋮ Towards Gallai's path decomposition conjecture ⋮ On Gallai's conjecture for graphs with maximum degree 6 ⋮ Hamilton path decompositions of complete multipartite graphs ⋮ Gallai's path decomposition conjecture for triangle-free planar graphs ⋮ Path and cycle decompositions of dense graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Path decompositions of regular graphs with prescribed girth
• On path decompositions of \(2k\)-regular graphs
• 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