论文信息 - Bypaths in Tournaments

Bypaths in Tournaments

Abstract If every arc of a 3-connected tournament T is contained in a cycle of length 3, then every arc of T has a bypath of length k for each k ⩾ 3, unless T is isomorphic to two tournaments, each of which has exactly 8 vertices. This extends the corresponding result for regular tournaments, due to Alspach, Reid and Roselle (1974).

Lutz Volkmann | Yubao Guo

[1] Brian Alspach,et al. Bypasses in asymmetric digraphs , 1974 .

[2] Z Wu,et al. A NECESSARY AND SUFFICIENT CONDITION FOR ARC-PANCYCLICITY OF TOURNAMENTS , 1982 .

[3] Cun-Quan Zhang,et al. Cycles of each length in tournaments , 1982, J. Comb. Theory, Ser. B.

[4] Zhang Ke-min. Completely strong path-connected tournaments , 1982 .

[5] Brian Alspach,et al. Cycles of Each Length in Regular Tournaments , 1967, Canadian Mathematical Bulletin.

[6] Carsten Thomassen,et al. Hamiltonian-connected tournaments , 1980, J. Comb. Theory B.