Note on the degree sequences of \(k\)-hypertournaments
From MaRDI portal
Publication:2483417
DOI10.1016/j.disc.2007.05.002zbMath1140.05044OpenAlexW1983506429WikidataQ126263539 ScholiaQ126263539MaRDI QIDQ2483417
Publication date: 28 April 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.05.002
Related Items (13)
Score lists in tripartite hypertournaments ⋮ On vertex independence number of uniform hypergraphs ⋮ Regular Hypertournaments and Arc-Pancyclicity ⋮ On the scores and degrees in hypertournaments ⋮ The \(H\)-force set of a hypertournament ⋮ Score lists in \( (h, k)\)-bipartite hypertournaments ⋮ Degree sequence of oriented \(k\)-hypergraphs ⋮ Degree sequences of \(k\)-multi-hypertournaments ⋮ The (1, 2)-step competition graph of a hypertournament ⋮ Miscellaneous Digraph Classes ⋮ Symmetry in domination for hypergraphs with choice ⋮ Arc-pancyclicity of hypertournaments with irregularity at most two ⋮ On scores, losing scores and total scores in hypertournaments
Cites Work
- 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 score sequences of \(k\)-hypertournaments
- Hamiltonian paths and cycles in hypertournaments
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Note on the degree sequences of \(k\)-hypertournaments