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

DOI10.1016/S0012-365X(96)00094-5MaRDI QIDQ1367024zbMATH OpenFDO

Authors Marjorie Darrah, Yiping Liu, Cun-Quan Zhang

Publication date 6 January 1998

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

digraphtournamentvertex-pancyclicarc-pancyclic

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3675933 (Why is no real title available?)
• scientific article; zbMATH DE number 3461949 (Why is no real title available?)
• scientific article; zbMATH DE number 3257176 (Why is no real title available?)
• scientific article; zbMATH DE number 3293648 (Why is no real title available?)
• A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs
• Bypasses in asymmetric digraphs
• Cycles of Each Length in Regular Tournaments
• Cycles of each length in tournaments
• Digraphs with the path‐merging property
• Hamiltonian-connected tournaments
• Locally semicomplete digraphs: A generalization of tournaments
• On Sets of Arcs Containing No Cycles in a Tournament*
• On the structure of locally semicomplete digraphs
• Tournaments That Admit Exactly One Hamiltonian Circuit

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367024)