Elsevier

Discrete Mathematics

Volume 342, Issue 5, May 2019, Pages 1293-1299
Discrete Mathematics

Gallai’s path decomposition conjecture for graphs of small maximum degree

https://doi.org/10.1016/j.disc.2019.01.005Get rights and content
Under an Elsevier user license
open archive

Abstract

Gallai’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.

Keywords

05C70
Path decomposition
Maximum degree

Cited by (0)