Equitable partition of graphs into induced linear forests
Combinatorics
2019-08-15 v1 Discrete Mathematics
Abstract
It is proved that the vertex set of any simple graph can be equitably partitioned into subsets for any integer so that each of them induces a linear forest.
Keywords
Cite
@article{arxiv.1908.05075,
title = {Equitable partition of graphs into induced linear forests},
author = {Xin Zhang and Bei Niu},
journal= {arXiv preprint arXiv:1908.05075},
year = {2019}
}