Kings in bipartite hypertournaments
From MaRDI portal
Publication:2000582
DOI10.1007/S00373-019-02045-YzbMATH Open1416.05124OpenAlexW2946275933MaRDI QIDQ2000582FDOQ2000582
Authors: Vojislav Petrovic
Publication date: 28 June 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-019-02045-y
Recommendations
- Kings in multipartite hypertournaments
- Kings in bipartite tournaments
- Kings in multipartite tournaments and hypertournaments
- Kings in multipartite tournaments
- Kings in \(k\)-partite tournaments
- Kings in hypertournaments
- scientific article; zbMATH DE number 759635
- The number of kings in a multipartite tournament
- Toppling kings in multipartite tournaments by introducing new kings
- On the 3-kings and 4-kings in multipartite tournaments
Cites Work
- Kings in hypertournaments
- Edge-disjoint Hamiltonian cycles in hypertournaments
- Vertex-pancyclicity of hypertournaments
- Hamiltonian paths and cycles in hypertournaments
- Kings in \(k\)-partite tournaments
- Kings in multipartite tournaments
- The radii of n-partite tournaments
- What must be contained in every oriented k-uniform hypergraph
- Kings in bipartite tournaments
Cited In (6)
This page was built for publication: Kings in bipartite hypertournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000582)