Discrete MathematicsVolume 41, Issue 2, 1982, Pages 219-220CommunicationSome problems about linear arboricityAuthor links open overlay panelM. Habib, B. PerocheShow moreShareCitehttps://doi.org/10.1016/0012-365X(82)90209-6Get rights and contentUnder an Elsevier user licenseopen archiveAbstractWe present here a conjecture on partitioning the edges of a graph into k-linear forests (forest whose connected components are paths of length less or equal to k).Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1982 Published by Elsevier B.V.