2000 character limit reached
Gallai's path decomposition conjecture for graphs of small maximum degree
Published 20 Sep 2016 in math.CO and cs.DM | (1609.06257v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
