Abstract
For a given integer k, a given graph G on n vertices is called k-step Hamiltonian (or just k-SH) if the vertices of G can be labeled as v(1), v(2), ........
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
