Each 3-strong tournament contains 3 vertices whose out-arcs are pancyclic

DOI10.1007/s00373-009-0842-zzbMath1207.05070OpenAlexW1999639637MaRDI QIDQ1043814

Jinfeng Feng

Publication date: 9 December 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-009-0842-z

zbMATH Keywords

cycletournamentpancyclicityout-arc

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items

The structure of 4‐strong tournaments containing exactly three out‐arc pancyclic vertices ⋮ Out-arc pancyclicity of vertices in tournaments ⋮ The number of out-pancyclic vertices in a strong tournament ⋮ A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic

Cites Work

• An \(s\)-strong tournament with \(s\geq 3\) has \(s+1\) vertices whose out-arcs are 4-pancyclic
• 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
• Unnamed Item
• Unnamed Item