scientific article; zbMATH DE number 3520431
From MaRDI portal
Publication:4100106
zbMATH Open0333.05104MaRDI QIDQ4100106FDOQ4100106
Authors: Michel Las Vergnas 
Publication date: 1975
Title of this publication is not available (Why is that?)
Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)
Cited In (9)
- Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three
- On the number of cycles in local tournaments
- Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\)
- Multipartite tournaments: a survey
- On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\)
- On complete strongly connected digraphs with the least number of 3-cycles
- Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs
- On the total distance between nodes in tournaments
- On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\)
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)
