科研之友
微信
新浪微博
Facebook
分享链接
摘要
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 > 3 so that each subset induces a forest. These results partially confirm a conjecture of Wu, Zhang and Li [5].
- 出版日期2015-2
- 单位西安电子科技大学
