Kings in bipartite hypertournaments

DOI10.1007/S00373-019-02045-YMaRDI QIDQ2000582zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

hypertournamentking

Mathematics Subject Classification ID

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

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

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

Cited in

(6)

• scientific article; zbMATH DE number 759635 (Why is no real title available?)
• Paths in \([ h , k ]\)-bipartite hypertournaments
• Number of 4-kings in bipartite tournaments with no 3-kings
• On the existence of kings in continuous tournaments
• Kings in multipartite hypertournaments
• The existence and uniqueness of strong kings in tournaments

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)