Gallai's conjecture for disconnected graphs
The authors prove that the minimum number of paths needed to partition the edge set of a graph is at most \( u/2 + \lfloor 2g/3 \rfloor\) where \(u\) is the number of vertices of odd degrees and \(g\) is the number of nonisolated vertices of even degrees.
scientific article; zbMATH DE number 1420374