论文信息 - An s-strong tournament with s>=3 has s+1 vertices whose out-arcs are 4-pancyclic

An s-strong tournament with s>=3 has s+1 vertices whose out-arcs are 4-pancyclic

An arc in a tournament T with n ≥ 3 vertices is called k-pancyclic, if it belongs to a cycle of length l for all k ≤ l ≤ n. In this paper, we show that each s-strong tournament with s ≥ 3 contains at least s + 1 vertices whose out-arcs are 4-pancyclic.

[1] Myron Goldberg,et al. Cycles in $k$-strong tournaments. , 1972 .

[2] Jinfeng Feng,et al. The number of vertices whose out-arcs are pancyclic in a 2-strong tournament , 2008, Discret. Appl. Math..

[3] Kemin Zhang,et al. Pancyclic out-arcs of a Vertex in Tournaments , 2000, Discret. Appl. Math..

[4] Gregory Gutin,et al. Digraphs - theory, algorithms and applications , 2002 .

[5] Anders Yeo. The number of pancyclic arcs in a k-strong tournament , 2005, J. Graph Theory.

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