Abstract
A graph G on n vertices is said to be (k, m)-pancyclic if every set of k vertices in G is contained in a cycle of length r for each r is an element of......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
