搜索结果: 1-1 共查到“数学 involved”相关记录1条 . 查询时间(0.093 秒)
A graph g is k-ordered Hamiltonian, 2 ≤ k ≤ n, if for every ordered sequence S of k distinct vertices of G, there exists a Hamiltonian cycle that encounters S in the given order. In this article, we p...
