科研之友
微信
新浪微博
Facebook
分享链接
摘要
The vertex arboricity of a graph is the minimum number of colors to color such that each color class induces a forest. The list vertex arboricity is the list-coloring version of this concept. Zhen and Wu conjectured that whenever . In this paper, we prove the weaker version of the conjecture obtained by replacing with .
