Discrete MathematicsVolume 342, Issue 5, May 2019, Pages 1293-1299Gallai’s path decomposition conjecture for graphs of small maximum degreeAuthor links open overlay panelMarthe Bonamy a, Thomas J. Perrett bShow moreShareCitehttps://doi.org/10.1016/j.disc.2019.01.005Get rights and contentUnder an Elsevier user licenseopen archiveAbstractGallai’s path decomposition conjecture states that the edges of any connected graph on n vertices can be decomposed into at most n+12 paths. We confirm that conjecture for all graphs with maximum degree at most five.Previous article in issueNext article in issueKeywords05C70Path decompositionMaximum degreeRecommended articlesCited by (0)© 2019 Elsevier B.V.