Number of 4-kings in bipartite tournaments with no 3-kings
From MaRDI portal
Publication:1918562
DOI10.1016/0012-365X(95)00051-WzbMath0851.05053WikidataQ126975323 ScholiaQ126975323MaRDI QIDQ1918562
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
05C75: Structural characterization of families of graphs
05C20: Directed graphs (digraphs), tournaments
Related Items
On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs, \((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs, Toppling kings in multipartite tournaments by introducing new kings, The number of kings in a multipartite tournament, On the kings and kings-of-kings in semicomplete multipartite digraphs, On semicomplete multipartite digraphs whose king sets are semicomplete digraphs, On the 3-kings and 4-kings in multipartite tournaments, Multipartite tournaments: a survey, 3-kings in 3-partite tournaments, Semicomplete Multipartite Digraphs, Quasi-Transitive Digraphs and Their Extensions
Cites Work