Note: The number of vertices whose out-arcs are pancyclic in a 2-strong tournament

Authors:
Ruijuan Li;Shengjia Li;Jinfeng Feng
Affiliations:
School of Mathematical Sciences, Shanxi University, 030006 Taiyuan, PR China;School of Mathematical Sciences, Shanxi University, 030006 Taiyuan, PR China;Lehrstuhl C für Mathematik, RWTH Aachen University, 52056 Aachen, Germany
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 2
Cited 2

Pancyclic out-arcs of a vertex in tournaments

Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
The number of pancyclic arcs in a k-strong tournament

Journal of Graph Theory

Out-arc pancyclicity of vertices in tournaments

Discrete Applied Mathematics
The structure of 4-strong tournaments containing exactly three out-arc pancyclic vertices

Journal of Graph Theory

Quantified Score

Hi-index	0.04

Visualization

Abstract

An arc going out from a vertex x in a digraph is called an out-arc of x. Yao et al. [Discrete Appl. Math. 99 (2000) 245-249] proved that every strong tournament contains a vertex x such that all out-arcs of x are pancyclic. Recently, Yeo [J. Graph Theory 50 (2005) 212-219] proved that each 3-strong tournament contains two such vertices. In this paper, we confirm that Yeo's result is also true for 2-strong tournaments. Our proof implies a polynomial algorithm to find two such vertices.