Abstract
We define the induced arboricity of a graph G, denoted by ia(G), as the smallest k such that the edges of G can be covered with k induced forests in G......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
