Equitable partition of graphs into induced linear forests

Abstract

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

References in corpus (2)

• Equitable partition of graphs into induced forests
• Equitable partition of plane graphs with independent crossings into induced forests