The number of tournaments with a unique spanning cycle
From MaRDI portal
Publication:3916591
DOI10.1002/jgt.3190060306zbMath0465.05036OpenAlexW2033782833MaRDI QIDQ3916591
Publication date: 1982
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190060306
Enumeration in graph theory (05C30) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)
Related Items
IRREDUCIBLE TOURNAMENTS WITH THE MINIMUM NUMBER OF 3-CYCLES, On \(n\)-partite tournaments with unique \(n\)-cycle