Kings in hypertournaments
From MaRDI portal
Publication:2376101
Recommendations
Cites work
- An application of the Ramsey theorem to ordered r-tournaments
- Edge-disjoint Hamiltonian cycles in hypertournaments
- Enchainabilité et seuil de monomorphie des tournois \(n\)-aires. (Chainability and threshold of the monomorphy of \(n\)-ary tournaments)
- Hamiltonian paths and cycles in hypertournaments
- Vertex-pancyclicity of hypertournaments
- What must be contained in every oriented k-uniform hypergraph
Cited in
(10)- Kings in bipartite hypertournaments
- The \(H\)-force set of a hypertournament
- Kings in strong tournaments.
- On pancyclic arcs in hypertournaments
- scientific article; zbMATH DE number 3952826 (Why is no real title available?)
- scientific article; zbMATH DE number 4025468 (Why is no real title available?)
- scientific article; zbMATH DE number 870946 (Why is no real title available?)
- Kings in multipartite tournaments and hypertournaments
- Kings in multipartite hypertournaments
- A new perspective from hypertournaments to tournaments
This page was built for publication: Kings in hypertournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376101)