Add to ORKGIn some recent papers the method of partial differences introduced by the author in [4] was very helpful in the construction of cyclic cycle systems. Here we use and describe in all details this method for the purpose of constructing, more generally, cycle decompositions with a sharply vertex transitive automorphism group not necessarily cyclic
AbstractWe call a partially ordered set Λ sharply transitive if its group of order automorphisms is ...
AbstractThe action of a subgroupGof automorphisms of a graphXis said to be 12-transitiveif it is ver...
AbstractWe prove that with the possible exception of total orders every tournament with sharply tran...
In some recent papers the method of partial differences introduced by the author in [4] was very hel...
In some recent papers the method of partial differences introduced by the author [4] was very helpfu...
Given a bowtie decomposition of the complete graph Kvadmitting an automorphism group G acting transi...
In this paper we consider decompositions of the complete graph Kv into matchings of uniform cardinal...
The concept of a strong difference family formally introduced in Buratti [J Combin Designs 7 (1999),...
A decomposition of the complete graph $K_v$ into copies of a subgraph Γ is called a sharply transiti...
The first part of this dissertation deals with highly symmetrical combinatorial structures - vertex ...
In this paper I shall try to review some results which were obtained in the area of factorizations a...
AbstractA graph X, with a subgroup G of the automorphism group Aut(X) of X, is said to be (G,s)-tran...
AbstractBy definition, Cayley graphs are vertex-transitive, and graphs underlying regular or orienta...
Digraphs having the property of the title were considered by Babai, Cameron, Deza and Sighi in 1981....
Given a finite group G of even order, which graphs T have a 1-factorization admitting G as an automo...
AbstractWe call a partially ordered set Λ sharply transitive if its group of order automorphisms is ...
AbstractThe action of a subgroupGof automorphisms of a graphXis said to be 12-transitiveif it is ver...
AbstractWe prove that with the possible exception of total orders every tournament with sharply tran...
In some recent papers the method of partial differences introduced by the author in [4] was very hel...
In some recent papers the method of partial differences introduced by the author [4] was very helpfu...
Given a bowtie decomposition of the complete graph Kvadmitting an automorphism group G acting transi...
In this paper we consider decompositions of the complete graph Kv into matchings of uniform cardinal...
The concept of a strong difference family formally introduced in Buratti [J Combin Designs 7 (1999),...
A decomposition of the complete graph $K_v$ into copies of a subgraph Γ is called a sharply transiti...
The first part of this dissertation deals with highly symmetrical combinatorial structures - vertex ...
In this paper I shall try to review some results which were obtained in the area of factorizations a...
AbstractA graph X, with a subgroup G of the automorphism group Aut(X) of X, is said to be (G,s)-tran...
AbstractBy definition, Cayley graphs are vertex-transitive, and graphs underlying regular or orienta...
Digraphs having the property of the title were considered by Babai, Cameron, Deza and Sighi in 1981....
Given a finite group G of even order, which graphs T have a 1-factorization admitting G as an automo...
AbstractWe call a partially ordered set Λ sharply transitive if its group of order automorphisms is ...
AbstractThe action of a subgroupGof automorphisms of a graphXis said to be 12-transitiveif it is ver...
AbstractWe prove that with the possible exception of total orders every tournament with sharply tran...