Line k-Arboricity in Product Networks

Yaping Mao, Zhiwei Guo, Nan Jia +1

A \emph{linear $k$-forest} is a forest whose components are paths of length at most $k$. The \emph{linear $k$-arboricity} of a graph $G$, denoted by ${\mathrm{la}}_k(G)$, is the least n…