scientific article; zbMATH DE number 3520431
From MaRDI portal
zbMath0333.05104MaRDI QIDQ4100106
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)
Related Items
On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\), Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs, On the total distance between nodes in 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, Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\), Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three, On the number of cycles in local tournaments
