AbstractThe notions of rotational tournament and the associated symbol set are generalized to r-tournaments. It is shown that a necessary and sufficient condition for the existence of a rotational r-tournament on n vertices is (n, r)=1. A scheme to generate rotational r- tournaments is given, along with some examples
AbstractA king in a tournament is a vertex which can reach every other vertex via a 1-path or 2-path...
We study round-robin tournaments for n teams, where in each round a fixed number (g) of teams is pre...
AbstractThe aim of this note is to show how existing product constructions for cyclic and 1-rotation...
AbstractThe notions of rotational tournament and the associated symbol set are generalized to r-tour...
AbstractClaudette Tabib has characterized the near-homogeneous tournaments and has shown the existen...
AbstractIn this article we present the action of a decomposition criterion for regular tournaments, ...
AbstractWe discuss when two tournaments defined on the same set of n vertices are equivalent under a...
AbstractIn this paper we show that the hamiltonian tournaments Hm, m ⩾ 4, with a normal simple quoti...
AbstractClaudette Tabib has characterized the near-homogeneous tournaments and has shown the existen...
AbstractA tournament is simple if the corresponding relational system is simple in the algebraic sen...
AbstractA Steiner triple system S(υ) of order υ is said to be k-ratational (k positive integer) if i...
AbstractThe paper deals with tournaments (i.e., with trichotomic relations) and their homomorphisms....
In this thesis, we are concerned with some combinatorial designs ---1- rotational (v, 4, 1) designs,...
AbstractLet T(R) denote the set of all tournaments with score vector R = (r1, r2,…, rn). R. A. Brual...
AbstractDoubly regular tournaments and homogeneous tournaments are defined and shown to be equivalen...
AbstractA king in a tournament is a vertex which can reach every other vertex via a 1-path or 2-path...
We study round-robin tournaments for n teams, where in each round a fixed number (g) of teams is pre...
AbstractThe aim of this note is to show how existing product constructions for cyclic and 1-rotation...
AbstractThe notions of rotational tournament and the associated symbol set are generalized to r-tour...
AbstractClaudette Tabib has characterized the near-homogeneous tournaments and has shown the existen...
AbstractIn this article we present the action of a decomposition criterion for regular tournaments, ...
AbstractWe discuss when two tournaments defined on the same set of n vertices are equivalent under a...
AbstractIn this paper we show that the hamiltonian tournaments Hm, m ⩾ 4, with a normal simple quoti...
AbstractClaudette Tabib has characterized the near-homogeneous tournaments and has shown the existen...
AbstractA tournament is simple if the corresponding relational system is simple in the algebraic sen...
AbstractA Steiner triple system S(υ) of order υ is said to be k-ratational (k positive integer) if i...
AbstractThe paper deals with tournaments (i.e., with trichotomic relations) and their homomorphisms....
In this thesis, we are concerned with some combinatorial designs ---1- rotational (v, 4, 1) designs,...
AbstractLet T(R) denote the set of all tournaments with score vector R = (r1, r2,…, rn). R. A. Brual...
AbstractDoubly regular tournaments and homogeneous tournaments are defined and shown to be equivalen...
AbstractA king in a tournament is a vertex which can reach every other vertex via a 1-path or 2-path...
We study round-robin tournaments for n teams, where in each round a fixed number (g) of teams is pre...
AbstractThe aim of this note is to show how existing product constructions for cyclic and 1-rotation...
DOI
Add to ORKG