Communication
Some problems about linear arboricity

https://doi.org/10.1016/0012-365X(82)90209-6Get rights and content
Under an Elsevier user license
open archive

Abstract

We 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).

Cited by (0)