Trail-connected tournaments

作者：

Highlights：

• Every strong tournament with n=|V(D)|≥3 is weakly trail-connected.

• A necessary and sufficient condition for a tournament to be strongly trail-connected is obtained.

摘要

•Every strong tournament with n=|V(D)|≥3 is weakly trail-connected.•A necessary and sufficient condition for a tournament to be strongly trail-connected is obtained.

论文关键词：Tournament,Digraphs,Hamiltonian-connected,Trail-connected

论文评审过程：Received 5 March 2020, Revised 27 July 2020, Accepted 2 August 2020, Available online 25 August 2020, Version of Record 25 August 2020.

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