Gallai's path decomposition conjecture for graphs of small maximum degree
Combinatorics
2016-09-21 v1 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1609.06257,
title = {Gallai's path decomposition conjecture for graphs of small maximum degree},
author = {Marthe Bonamy and Thomas Perrett},
journal= {arXiv preprint arXiv:1609.06257},
year = {2016}
}
Comments
11 pages, 11 figures, submitted