Number of 4-kings in bipartite tournaments with no 3-kings

DOI10.1016/0012-365X(95)00051-WzbMath0851.05053OpenAlexW2063267032WikidataQ126975323 ScholiaQ126975323MaRDI QIDQ1918562

B. P. Tan, Khee Meng Koh

Publication date: 18 July 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00051-w

zbMATH Keywords

distanceringsbipartite tournament

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (11)

The number of kings in a multipartite tournament ⋮ On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs ⋮ On semicomplete multipartite digraphs whose king sets are semicomplete digraphs ⋮ On the 3-kings and 4-kings in multipartite tournaments ⋮ \((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs ⋮ Multipartite tournaments: a survey ⋮ 3-kings in 3-partite tournaments ⋮ Toppling kings in multipartite tournaments by introducing new kings ⋮ On the kings and kings-of-kings in semicomplete multipartite digraphs ⋮ Semicomplete Multipartite Digraphs ⋮ Quasi-Transitive Digraphs and Their Extensions

Cites Work

• Unnamed Item
• The radii of n-partite tournaments
• Every vertex a king
• On multipartite tournaments
• Kings in \(k\)-partite tournaments
• Kings in bipartite tournaments
• Kings in multipartite tournaments

This page was built for publication: Number of 4-kings in bipartite tournaments with no 3-kings