Cycles of all lengths in arc-3-cyclic semicomplete digraphs

DOI10.1016/S0012-365X(96)00094-5zbMath0880.05056MaRDI QIDQ1367024

Marjorie Darrah, Cun-Quan Zhang, Yi-Ping Liu

Publication date: 6 January 1998

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

zbMATH Keywords

digraphtournamentvertex-pancyclicarc-pancyclic

Mathematics Subject Classification ID

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

Related Items (2)

On \(d\)-panconnected tournaments with large semidegrees ⋮ Tournaments and Semicomplete Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian-connected tournaments
• Cycles of each length in tournaments
• On the structure of locally semicomplete digraphs
• Bypasses in asymmetric digraphs
• Locally semicomplete digraphs: A generalization of tournaments
• A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs
• Digraphs with the path‐merging property
• Cycles of Each Length in Regular Tournaments
• On Sets of Arcs Containing No Cycles in a Tournament*
• Tournaments That Admit Exactly One Hamiltonian Circuit

This page was built for publication: Cycles of all lengths in arc-3-cyclic semicomplete digraphs