Abstract
A digraph of order n is k-traceable if n >= k and each of its induced subdigraphs of order k is traceable. It is known that if 2 <= k <= 6, e......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
