scientific article; zbMATH DE number 3520431

MaRDI QIDQ4100106zbMATH OpenFDO

Authors Michel Las Vergnas

Publication date 1975

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cited in

(9)

• On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\)
• On the number of cycles in local tournaments
• On complete strongly connected digraphs with the least number of 3-cycles
• On the total distance between nodes in tournaments
• Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs
• Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three
• Multipartite tournaments: a survey
• On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\)
• Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4100106)