On score sequences of k-hypertournaments
From MaRDI portal
Recommendations
Cites work
- A generalization of rotational tournaments
- 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
- The Theory of Round Robin Tournaments
- What must be contained in every oriented k-uniform hypergraph
Cited in
(21)- The \(H\)-force set of a hypertournament
- scientific article; zbMATH DE number 5711519 (Why is no real title available?)
- Regular Hypertournaments and Arc-Pancyclicity
- scientific article; zbMATH DE number 2201401 (Why is no real title available?)
- Symmetry in domination for hypergraphs with choice
- On vertex independence number of uniform hypergraphs
- Score sets in \(k\)-partite tournaments
- On \(k\)-hypertournament matrices
- On score sequences of \(k\)-hypertournaments
- The (1, 2)-step competition graph of a hypertournament
- Note on the degree sequences of \(k\)-hypertournaments
- Scores, inequalities and regular hypertournaments
- On the scores and degrees in hypertournaments
- scientific article; zbMATH DE number 1941832 (Why is no real title available?)
- scientific article; zbMATH DE number 4123761 (Why is no real title available?)
- Score sequences in oriented \(k\)-hypergraphs
- Uniform sampling of \(k\)-hypertournaments
- On scores, losing scores and total scores in \(k\)-hypertournaments
- Miscellaneous digraph classes
- Degree sequences of k-multi-hypertournaments
- Score lists in tripartite hypertournaments
This page was built for publication: On score sequences of \(k\)-hypertournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1590213)
