An \(s\)-strong tournament with \(s\geq 3\) has \(s+1\) vertices whose out-arcs are 4-pancyclic

DOI10.1016/J.DAM.2006.04.022zbMath1112.05047OpenAlexW1999734424MaRDI QIDQ858311

Jinfeng Feng, Rui Juan Li, Sheng-Jia Li

Publication date: 9 January 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.04.022

zbMATH Keywords

cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (2)

The structure of 4‐strong tournaments containing exactly three out‐arc pancyclic vertices ⋮ Each 3-strong tournament contains 3 vertices whose out-arcs are pancyclic

Cites Work

• Unnamed Item
• Hamiltonian-connected tournaments
• Pancyclic out-arcs of a vertex in tournaments
• The number of vertices whose out-arcs are pancyclic in a 2-strong tournament
• Cycles in k-strong tournaments
• The number of pancyclic arcs in a k‐strong tournament

This page was built for publication: An \(s\)-strong tournament with \(s\geq 3\) has \(s+1\) vertices whose out-arcs are 4-pancyclic