IRREDUCIBLE TOURNAMENTS WITH THE MINIMUM NUMBER OF 3-CYCLES

DOI10.1080/16073606.1993.9631734MaRDI QIDQ4288042zbMATH OpenOpenAlexFDO

Authors J. W. Moon

Publication date 21 April 1994

Published in Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/16073606.1993.9631734

zbMATH Keywords

3-cyclesirreducible tournamentsscore sequence

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3950564
• scientific article; zbMATH DE number 238433
• Parsimonious and improvident 2-tournament matrices
• scientific article; zbMATH DE number 4168706
• scientific article; zbMATH DE number 733162

Cites work

• Hamiltonian tournaments with the least number of 3-cycles
• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• On enumerating tournaments that admit exactly one Hamiltonian circuit
• On Subtournaments of a Tournament
• The number of tournaments with a unique spanning cycle
• Tournaments That Admit Exactly One Hamiltonian Circuit

Cited in

(6)

• Characterizations of the 3-cycle count and backward length of a tournament
• scientific article; zbMATH DE number 4152407 (Why is no real title available?)
• scientific article; zbMATH DE number 4035865 (Why is no real title available?)
• scientific article; zbMATH DE number 589725 (Why is no real title available?)
• scientific article; zbMATH DE number 238433 (Why is no real title available?)
• Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three

This page was built for publication: IRREDUCIBLE TOURNAMENTS WITH THE MINIMUM NUMBER OF 3-CYCLES

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