Kings in bipartite hypertournaments

DOI10.1007/S00373-019-02045-YzbMath1416.05124OpenAlexW2946275933MaRDI QIDQ2000582

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

zbMATH Keywords

hypertournamentking

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Kings in multipartite hypertournaments ⋮ Paths in \([ h , k \)-bipartite hypertournaments]

Cites Work

• The radii of n-partite tournaments
• What must be contained in every oriented k-uniform hypergraph
• Kings in \(k\)-partite tournaments
• Kings in bipartite tournaments
• Kings in multipartite tournaments
• Kings in hypertournaments
• Edge-disjoint Hamiltonian cycles in hypertournaments
• Vertex-pancyclicity of hypertournaments
• Hamiltonian paths and cycles in hypertournaments

This page was built for publication: Kings in bipartite hypertournaments