Abstract
Let G be a bridgeless graph and denote by cc(G) the shortest length of a cycle cover of G. Let V (2)(G) be the set of vertices of degree 2 in G. It is......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
