Hamiltonian tournaments with the least number of 3-cycles
From MaRDI portal
Publication:3351381
DOI10.1002/jgt.3190140606zbMath0728.05024MaRDI QIDQ3351381
Marco Burzio, Davide Carlo Demaria
Publication date: 1990
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140606
Related Items
IRREDUCIBLE TOURNAMENTS WITH THE MINIMUM NUMBER OF 3-CYCLES, Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three, On the number of cycles in local tournaments, On local characterizations of Hamiltonian tournaments, A larger class of reconstructible tournaments, On complete strongly connected digraphs with the least number of 3-cycles, On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\), Multipartite tournaments: a survey
Cites Work