Equitable partition of graphs into induced linear forests

08/14/2019

∙

by   Xin Zhang, et al.

∙

0

∙

share

It is proved that the vertex set of any simple graph G can be equitably partitioned into k subsets for any integer k≥max{Δ(G)+1/2,|G|/4} so that each of them induces a linear forest.