A conjecture on cycle-pancyclism in tournaments
From MaRDI portal
(Redirected from A conjecture on cycle-pancyclism in tournaments)
Recommendations
Cited in
(17)- Polynomial time recognition and testing of isomorphism of cyclic tournaments
- Characterizations of the 3-cycle count and backward length of a tournament
- Cycle-pancyclism in tournaments. I
- On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture
- Lichiardopol's conjecture on disjoint cycles in tournaments
- scientific article; zbMATH DE number 3950564 (Why is no real title available?)
- scientific article; zbMATH DE number 4035865 (Why is no real title available?)
- On high-dimensional acyclic tournaments
- scientific article; zbMATH DE number 718575 (Why is no real title available?)
- scientific article; zbMATH DE number 1080072 (Why is no real title available?)
- Elementary proof of a counting formula for acyclic bipartite tournaments
- Loopy, Hankel, and combinatorially skew-Hankel tournaments
- Acyclic sets in k-majority tournaments
- Cycle-pancyclism in tournaments. III
- A relativized measure of circularity for tournaments
- A characterization of semitwin digraphs
- Circulant tournaments of prime order are tight
This page was built for publication: A conjecture on cycle-pancyclism in tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4254308)
