Universal arcs in tournaments

作者：Bai, Yandong^*; Li, Binlong; Li, Hao; He, Weihua

来源：Discrete Mathematics, 2016, 339(8): 2063-2065.

DOI：10.1016/j.disc.2016.02.011

• Universal arc
• Tournament

An arc uv of a digraph D is called universal if uv and w are in a common cycle for any vertex w of D. We show that every arc of a tournament T is universal if and only if T is either 2-connected or has a cut-vertex v such that the in- and out-neighbors of v both induce strongly connected subtournaments.

• 出版日期2016-8-6
• 单位江汉大学; 西北工业大学