Title of article
Covering the Edges of a Connected Graph by Paths
Author/Authors
Pyber، نويسنده , , L.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
8
From page
152
To page
159
Abstract
We prove that every connected graph onnvertices can be covered by at mostn/2+O(n3/4) paths. This implies that a weak version of a well-known conjecture of Gallai is asymptotically true.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1996
Journal title
Journal of Combinatorial Theory Series B
Record number
1526088
Link To Document