Equitable partition of graphs into induced linear forests

From MaRDI portal
Publication:2292162




Abstract: It is proved that the vertex set of any simple graph G can be equitably partitioned into k subsets for any integer so that each of them induces a linear forest.









This page was built for publication: Equitable partition of graphs into induced linear forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292162)