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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
