Publication date
May 1996
DOI Publisher
Elsevier Science B.V. ISSN
0012-365XAbstract
AbstractNecessary and sufficient conditions are given for a finite group to admit a representation as the automorphism group of a k-tournament, k ⩾ 3
AbstractNecessary and sufficient conditions are given for a finite group to admit a representation as the automorphism group of a k-tournament, k ⩾ 3
We study the problem of extending partial isomorphisms for hypertournaments, which are relational st...
We investigate the possible structures imposed on a finite group by its possession of an automorphis...
AbstractA king in a tournament is a vertex which can reach every other vertex via a 1-path or 2-path...
AbstractNecessary and sufficient conditions are given for a finite group to admit a representation a...
This theses presents two main theorems to determine the existence of even tournaments whose automorp...
The thesis presents four main theorems on cyclic tournaments. The first deals with the problem of de...
AbstractWe discuss several results and problems of even tournaments and Hadamard tournaments
AbstractThe paper deals with tournaments (i.e., with trichotomic relations) and their homomorphisms....
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a su...
We define and study the graph-theoretic notion of an anchor in a tournament. An anchor in a tourname...
The main result of this paper is a characterization of the abstract finite groups which are full aut...
AbstractA tournament T (directed graph in which there is exactly one arc between any two vertices) i...
AbstractIn this article we present the action of a decomposition criterion for regular tournaments, ...
This paper contains a graph theoretical algorithm based upon the concept of ergodic product of autom...
summary:We investigate tournaments that are projective in the variety that they generate, and free a...
We study the problem of extending partial isomorphisms for hypertournaments, which are relational st...
We investigate the possible structures imposed on a finite group by its possession of an automorphis...
AbstractA king in a tournament is a vertex which can reach every other vertex via a 1-path or 2-path...
AbstractNecessary and sufficient conditions are given for a finite group to admit a representation a...
This theses presents two main theorems to determine the existence of even tournaments whose automorp...
The thesis presents four main theorems on cyclic tournaments. The first deals with the problem of de...
AbstractWe discuss several results and problems of even tournaments and Hadamard tournaments
AbstractThe paper deals with tournaments (i.e., with trichotomic relations) and their homomorphisms....
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a su...
We define and study the graph-theoretic notion of an anchor in a tournament. An anchor in a tourname...
The main result of this paper is a characterization of the abstract finite groups which are full aut...
AbstractA tournament T (directed graph in which there is exactly one arc between any two vertices) i...
AbstractIn this article we present the action of a decomposition criterion for regular tournaments, ...
This paper contains a graph theoretical algorithm based upon the concept of ergodic product of autom...
summary:We investigate tournaments that are projective in the variety that they generate, and free a...
We study the problem of extending partial isomorphisms for hypertournaments, which are relational st...
We investigate the possible structures imposed on a finite group by its possession of an automorphis...
AbstractA king in a tournament is a vertex which can reach every other vertex via a 1-path or 2-path...
Add to ORKG