Covering the edges of a connected graph by paths
An edge cover of a graph \(G\) by paths is a set of paths so that every edge of \(G\) lies in at least one path. The author proves that every graph \(G\) of order \(n\) can be edge-covered by \({n\over 2}+ O(n^{3/4})\) paths.
scientific article; zbMATH DE number 839141