On score sequences of k-hypertournaments
From MaRDI portal
Publication:1590213
DOI10.1006/EUJC.2000.0393zbMATH Open0966.05037OpenAlexW1989301087MaRDI QIDQ1590213FDOQ1590213
Authors: Guofel Zhou, Tianxing Yao, Keming Zhang 
Publication date: 16 August 2001
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.2000.0393
Recommendations
Cites Work
- The Theory of Round Robin Tournaments
- Hamiltonian paths and cycles in hypertournaments
- What must be contained in every oriented k-uniform hypergraph
- A generalization of rotational tournaments
- Enchainabilité et seuil de monomorphie des tournois \(n\)-aires. (Chainability and threshold of the monomorphy of \(n\)-ary tournaments)
Cited In (21)
- Title not available (Why is that?)
- Regular Hypertournaments and Arc-Pancyclicity
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- The \(H\)-force set of a hypertournament
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)
