𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Ruijuan Li; Shengjia Li; Jinfeng Feng

Book ID
108112697
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
133 KB
Volume
156
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The number of pancyclic arcs in a k-stro
The number of pancyclic arcs in a k-strong tournament
✍ Anders Yeo πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 98 KB πŸ‘ 2 views

## Abstract A __tournament__ is a digraph, where there is precisely one arc between every pair of distinct vertices. An arc is __pancyclic__ in a digraph __D__, if it belongs to a cycle of length __l__, for all 3 ≀ __l__ ≀ |__V__ (__D__) |. Let __p__(__D__) denote the number of pancyclic arcs in a

The structure of 4-strong tournaments co
The structure of 4-strong tournaments containing exactly three out-arc pancyclic vertices
✍ Qiaoping Guo; Shengjia Li; Ruijuan Li πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 200 KB πŸ‘ 2 views

## Abstract Yao et al. (Discrete Appl Math 99 (2000), 245–249) proved that every strong tournament contains a vertex __u__ such that every out‐arc of __u__ is pancyclic and conjectured that every __k__‐strong tournament contains __k__ such vertices. At present, it is known that this conjecture is t