Gallai's path decomposition conjecture for graphs of small maximum degree
arXiv:1609.06257
Abstract
Gallai's path decomposition conjecture states that the edges of any connected graph on n vertices can be decomposed into at most (n+1)/2 paths. We confirm that conjecture for all graphs with maximum degree at most five.
11 pages, 11 figures, submitted