Cycles of all lengths in arc-3-cyclic semicomplete digraphs
From MaRDI portal
Publication:1367024
DOI10.1016/S0012-365X(96)00094-5zbMATH Open0880.05056MaRDI QIDQ1367024FDOQ1367024
Authors: Marjorie Darrah, Yiping Liu, Cun-Quan Zhang
Publication date: 6 January 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Locally semicomplete digraphs: A generalization of tournaments
- Hamiltonian-connected tournaments
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the structure of locally semicomplete digraphs
- On Sets of Arcs Containing No Cycles in a Tournament*
- Title not available (Why is that?)
- Cycles of Each Length in Regular Tournaments
- Tournaments That Admit Exactly One Hamiltonian Circuit
- A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs
- Digraphs with the path‐merging property
- Bypasses in asymmetric digraphs
- Cycles of each length in tournaments
- Title not available (Why is that?)
Cited In (2)
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)