Abstract
We prove that every connected graph on n vertices can be covered by at most n/2 + O(n3/4) paths. This implies that a weak version of a well-known conjecture of Gallai is asymptotically true. © 1996 Academic Press, Inc.
Cite
CITATION STYLE
APA
Pyber, L. (1996). Covering the edges of a connected graph by paths. Journal of Combinatorial Theory. Series B, 66(1), 152–159. https://doi.org/10.1006/jctb.1996.0012
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free