Paths in [h,k]-bipartite hypertournaments

作者：

Highlights：

• The hamiltonian path problem of [h, k]-bipartite hypertournament is thoroughly researched.

• The result in this paper is optimal and counterexamples are given for the remaining cases.

• The proposed method is the latest and can be applied to other problems of multi-hypertournament.

摘要

•The hamiltonian path problem of [h, k]-bipartite hypertournament is thoroughly researched.•The result in this paper is optimal and counterexamples are given for the remaining cases.•The proposed method is the latest and can be applied to other problems of multi-hypertournament.

论文关键词：[h,k]-Bipartite hypertournament,Hamiltonian path,k-Hypertournament

论文评审过程：Received 19 August 2021, Revised 31 January 2022, Accepted 3 February 2022, Available online 14 February 2022, Version of Record 14 February 2022.

论文官网地址：https://doi.org/10.1016/j.amc.2022.127005