Abstract
Let $G_1$ be a planar graph such that all cycles of length at most 4 are independent and let $G_2$ be a planar graph without 3-cycles and adjacent 4-cycles. It is proved that the set of vertices of $G_1$ and $G_2$ can be equitably partitioned into $t$ subsets for every $t\geq 3$ so that each subset induces a forest. These results partially confirm a conjecture of Wu, Zhang and Li [5].
Citation
Xin Zhang. "EQUITABLE VERTEX ARBORICITY OF PLANAR GRAPHS." Taiwanese J. Math. 19 (1) 123 - 131, 2015. https://doi.org/10.11650/tjm.19.2015.4422
Information
