A linear k-forest is a graph whose components are paths with lengths at most k. The minimum number of linear k-forests needed to decompose a graph G is the linear k-arboricity of G and denoted by ...

This is a preview. Log in through your library . Abstract This paper is mainly concerned with the realizability of a set of n integers as the degrees of vertices of an n-vertex linear graph. Other ...