Proper-walk connection of hamiltonian digraphs

作者：

Highlights：

• We disprove a conjecture proposed by Fiedorowicz, Sidorowicz, Sopena (Appl. Math. Comput. 410 (2021) 126253).

• In addition, we find a result of the above paper is not correct.

• Two sufficient conditions are given for a hamiltonian digraph D with wc→(D)=2.

摘要

•We disprove a conjecture proposed by Fiedorowicz, Sidorowicz, Sopena (Appl. Math. Comput. 410 (2021) 126253).•In addition, we find a result of the above paper is not correct.•Two sufficient conditions are given for a hamiltonian digraph D with wc→(D)=2.

论文关键词：Proper-walk connection,Hamiltonian digraph

论文评审过程：Received 6 January 2022, Revised 31 March 2022, Accepted 5 April 2022, Available online 16 April 2022, Version of Record 16 April 2022.

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