AbstractWe present a variety of results concerning characterization, number, distribution and some aspects of stability of r-kings (r = 2–4) of bipartite tournaments
AbstractA tournament is an orientation of a complete graph and a multipartite tournament is an orien...
[[abstract]]A king x in a tournament T is a player who beats any other player y directly (i.e., x ->...
AbstractA king in a directed graph is a vertex from which each vertex in the graph can be reached th...
AbstractWe show that in any n-partite tournament, where n ⩾ 3, with no transmitters and no 3-kings, ...
AbstractWe present a variety of results concerning characterization, number, distribution and some a...
AbstractLet T be an n-partite tournament and let kr(T) denote the number of r-kings of T. Gutin (198...
AbstractKoh and Tan gave a sufficient condition for a 3-partite tournament to have at least one 3-ki...
AbstractA king in a tournament is a vertex which can reach every other vertex via a 1-path or 2-path...
AbstractWe present all possible distributions of 3-kings in 3-partite tournaments with at most one t...
AbstractKoh and Tan showed in (Evaluation of the number of kings in a multipartite tournament, submi...
AbstractLet t=(t1,t2,…,tn) and c=(c1,c2,…,cn) be two n-tuples of nonnegative integers. An all-4-king...
AbstractA k-king in a digraph D is a vertex which can reach every other vertex by a directed path of...
AbstractA multipartite tournament is an orientation of a complete multipartite graph. Simple derivat...
A digraph obtained by replacing each edge of a complete p-partite graph by an arc or a pair of mutua...
[[abstract]]A king x in a tournament T is a player who beats any other player y directly (i.e., x ->...
AbstractA tournament is an orientation of a complete graph and a multipartite tournament is an orien...
[[abstract]]A king x in a tournament T is a player who beats any other player y directly (i.e., x ->...
AbstractA king in a directed graph is a vertex from which each vertex in the graph can be reached th...
AbstractWe show that in any n-partite tournament, where n ⩾ 3, with no transmitters and no 3-kings, ...
AbstractWe present a variety of results concerning characterization, number, distribution and some a...
AbstractLet T be an n-partite tournament and let kr(T) denote the number of r-kings of T. Gutin (198...
AbstractKoh and Tan gave a sufficient condition for a 3-partite tournament to have at least one 3-ki...
AbstractA king in a tournament is a vertex which can reach every other vertex via a 1-path or 2-path...
AbstractWe present all possible distributions of 3-kings in 3-partite tournaments with at most one t...
AbstractKoh and Tan showed in (Evaluation of the number of kings in a multipartite tournament, submi...
AbstractLet t=(t1,t2,…,tn) and c=(c1,c2,…,cn) be two n-tuples of nonnegative integers. An all-4-king...
AbstractA k-king in a digraph D is a vertex which can reach every other vertex by a directed path of...
AbstractA multipartite tournament is an orientation of a complete multipartite graph. Simple derivat...
A digraph obtained by replacing each edge of a complete p-partite graph by an arc or a pair of mutua...
[[abstract]]A king x in a tournament T is a player who beats any other player y directly (i.e., x ->...
AbstractA tournament is an orientation of a complete graph and a multipartite tournament is an orien...
[[abstract]]A king x in a tournament T is a player who beats any other player y directly (i.e., x ->...
AbstractA king in a directed graph is a vertex from which each vertex in the graph can be reached th...
DOI
Add to ORKG