Universal arcs in tournaments

被引：1

作者：

Bai, Yandong ^{[1
,2
]}

Li, Binlong ^{[1
,3
]}

Li, Hao ^{[2
,4
]}

He, Weihua ^{[2
]}

机构：

[1] Northwestern Polytech Univ, Dept Appl Math, Xian 710129, Peoples R China

[2] Univ Paris 11, CNRS, Lab Rech Informat, F-91405 Orsay, France

[3] Univ W Bohemia, Dept Math, Plzen 30614, Czech Republic

[4] Jianghan Univ, Inst Interdisciplinary Res, Wuhan 430056, Peoples R China

来源：

DISCRETE MATHEMATICS | 2016年 / 339卷 / 08期

关键词：

Universal arc; Tournament;

D O I：

10.1016/j.disc.2016.02.011

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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. (C) 2016 Elsevier B.V. All rights reserved.

引用

页码：2063 / 2065

页数：3