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

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

Citing 3
Cited 1

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
Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications

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 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.