On enumerating tournaments that admit exactly one Hamiltonian circuit

DOI10.1016/0095-8956(72)90062-7zbMath0233.05004OpenAlexW2051468852MaRDI QIDQ2551106

Michael R. Garey

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(72)90062-7

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

IRREDUCIBLE TOURNAMENTS WITH THE MINIMUM NUMBER OF 3-CYCLES ⋮ A characterization of unique tournaments ⋮ On \(n\)-partite tournaments with unique \(n\)-cycle

Cites Work

• Tournaments That Admit Exactly One Hamiltonian Circuit
• Unnamed Item

This page was built for publication: On enumerating tournaments that admit exactly one Hamiltonian circuit