Article contents
Almost Every Graph can be Covered by Linear Forests
Published online by Cambridge University Press: 12 September 2008
Abstract
A linear forest is the union of a set of vertex disjoint paths. Akiyama, Exoo and Harary, and independently Hilton, have conjectured that the edges of every graph of maximum degree Δ can be covered by linear forests. We show that almost every graph can be covered with this number of linear forests.
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1995
References
- 2
- Cited by