The radii of n-partite tournaments
From MaRDI portal
Publication:582300
DOI10.1007/BF01142481zbMath0691.05016MaRDI QIDQ582300
Publication date: 1986
Published in: Mathematical Notes (Search for Journal in Brave)
Related Items (22)
On the complexity of kings ⋮ The number of kings in a multipartite tournament ⋮ Kings in bipartite tournaments ⋮ Kings in multipartite tournaments ⋮ Number of 4-kings in bipartite tournaments with no 3-kings ⋮ Kings in semicomplete multipartite digraphs ⋮ Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey ⋮ On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs ⋮ Kings in multipartite hypertournaments ⋮ On semicomplete multipartite digraphs whose king sets are semicomplete digraphs ⋮ On the 3-kings and 4-kings in multipartite tournaments ⋮ \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs ⋮ Proximity and remoteness in directed and undirected graphs ⋮ Kings and serfs in oriented graphs ⋮ Kings in locally semicomplete digraphs ⋮ Multipartite tournaments: a survey ⋮ 3-kings in 3-partite tournaments ⋮ Kings in bipartite hypertournaments ⋮ Toppling kings in multipartite tournaments by introducing new kings ⋮ On the kings and kings-of-kings in semicomplete multipartite digraphs ⋮ Semicomplete Multipartite Digraphs ⋮ Kings in quasi-transitive digraphs
Cites Work
This page was built for publication: The radii of n-partite tournaments