Equitable vertex arboricity of 5-degenerate graphs |
| |
| Authors: | Guantao Chen Yuping Gao Songling Shan Guanghui Wang Jianliang Wu |
| |
| Affiliation: | 1.Department of Mathematics and Statistics,Georgia State University,Atlanta,USA;2.School of Mathematics,Shandong University,Jinan,China;3.Department of Mathematics,Vanderbilt University,Nashville,USA |
| |
| Abstract: | Wu et al. (Discret Math 313:2696–2701, 2013) conjectured that the vertex set of any simple graph G can be equitably partitioned into m subsets so that each subset induces a forest, where (Delta (G)) is the maximum degree of G and m is an integer with (mge lceil frac{Delta (G)+1}{2}rceil ). This conjecture is verified for 5-degenerate graphs in this paper. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
