Abstract
A graph G is two-disjoint-cycle-cover vertex [r(1), r(2)]-pancyclic if, for any two distinct vertices u, v is an element of V(G) and any positive inte......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
