Abstract
The spanning tree packing number of a graph G is the maximum number of edge-disjoint spanning trees in G, and the arboricity of G is the minimum numbe......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
