IRREDUCIBLE TOURNAMENTS WITH THE MINIMUM NUMBER OF 3-CYCLES

DOI10.1080/16073606.1993.9631734zbMath0796.05043OpenAlexW2038740383MaRDI QIDQ4288042

John 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

score sequence3-cyclesirreducible tournaments

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On enumerating tournaments that admit exactly one Hamiltonian circuit
• Hamiltonian tournaments with the least number of 3-cycles
• The number of tournaments with a unique spanning cycle
• On Subtournaments of a Tournament
• Tournaments That Admit Exactly One Hamiltonian Circuit

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