1. Lovász, L.: On covering of graphs. In: Erdös, P., Katona, G. (eds.) Theory of Graphs, pp. 231–236. Academic Press, New York (1968)
2. Donald, A.: An upper bound for the path number of a graph. J. Graph Theory 4(2), 189–201 (1980)
3. Dean, N., Kouider, M.: Gallai’s conjecture for disconnected graphs. Discret. Math. 213(1–3), 43–54 (2000)
4. Yan, L.: On path decompositions of graphs. Ph.D. Thesis, Arizona State University (1998)
5. Favaron, O., Kouider, M.: Path partitions and cycle partitions of Eulerian graphs of maximum degree 4. Studia Sci. Math. Hungar. 23(1–2), 237–244 (1988)