On the scores and degrees in hypertournaments
From MaRDI portal
Publication:907010
DOI10.1515/ausi-2015-0019zbMath1329.05137OpenAlexW2519909633MaRDI QIDQ907010
Antal Iványi, Rameez Raja, Shariefuddin Pirzada
Publication date: 1 February 2016
Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/ausi-2015-0019
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On vertex independence number of uniform hypergraphs
- On score sets in tournaments
- Score sequences in oriented graphs
- Score lists in \( (h, k)\)-bipartite hypertournaments
- Enchainabilité et seuil de monomorphie des tournois \(n\)-aires. (Chainability and threshold of the monomorphy of \(n\)-ary tournaments)
- What must be contained in every oriented k-uniform hypergraph
- A generalization of rotational tournaments
- On \(k\)-hypertournament matrices
- On score sequences of \(k\)-hypertournaments
- Score lists in tripartite hypertournaments
- Note on the degree sequences of \(k\)-hypertournaments
- Mark sequences in digraphs
- Scores, inequalities and regular hypertournaments
- Score sets in oriented graphs
- Hamiltonian paths and cycles in hypertournaments
- Uniform sampling ofk-hypertournaments
- On scores, losing scores and total scores in hypertournaments
This page was built for publication: On the scores and degrees in hypertournaments