A conjecture on equitable vertex arboricity of graphs
Combinatorics
2012-11-22 v1 Discrete Mathematics
Abstract
Wu, Zhang and Li [4] conjectured that the set of vertices of any simple graph can be equitably partitioned into subsets so that each of them induces a forest of . In this note, we prove this conjecture for graphs with .
Cite
@article{arxiv.1211.4998,
title = {A conjecture on equitable vertex arboricity of graphs},
author = {Xin Zhang and Jian-Liang Wu},
journal= {arXiv preprint arXiv:1211.4998},
year = {2012}
}