Add to ORKGA decomposition of the complete graph K_v into copies of a subgraph G is called a sharply transitive G-decomposition if it is left invariant by an automorphism group acting sharply transitively on the vertex set of K_v. For suitable values of v we construct examples of sharply transitive G-decompositions when G is either a Petersen graph, a generalized Petersen graph or a prism
A bowtie is a graph consisting of two 3-cycles sharing a vertex. A kite is a connected graph consist...
A bowtie is a graph consisting of two 3-cycles sharing a vertex. A kite is a connected graph consist...
A finite graph Gamma is G-symmetric if it admits G as a group of automorphisms acting transitively o...
A decomposition of the complete graph K_v into copies of a subgraph G is called a sharply transitive...
A decomposition of the complete graph $K_v$ into copies of a subgraph Γ is called a sharply transiti...
A decomposition of a graph is a partition of the edge set. One can also look at partitions of the ar...
In this paper I shall try to review some results which were obtained in the area of factorizations a...
In this paper I shall try to review some results which were obtained in the area of factorizations a...
A transitive decomposition of a graph is a partition of the edge set together with a group of automo...
The concept of a strong difference family formally introduced in Buratti [J Combin Designs 7 (1999),...
The concept of a strong difference family formally introduced in Buratti [J Combin Designs 7 (1999),...
AbstractA transitive decomposition of a graph is a partition of the edge set together with a group o...
AbstractThe generalized Petersen graphs (GPGs) which have been invented by Watkins, may serve for pe...
In some recent papers the method of partial differences introduced by the author [4] was very helpfu...
A finite graph Gamma is G-symmetric if it admits G as a group of automorphisms acting transitively o...
A bowtie is a graph consisting of two 3-cycles sharing a vertex. A kite is a connected graph consist...
A bowtie is a graph consisting of two 3-cycles sharing a vertex. A kite is a connected graph consist...
A finite graph Gamma is G-symmetric if it admits G as a group of automorphisms acting transitively o...
A decomposition of the complete graph K_v into copies of a subgraph G is called a sharply transitive...
A decomposition of the complete graph $K_v$ into copies of a subgraph Γ is called a sharply transiti...
A decomposition of a graph is a partition of the edge set. One can also look at partitions of the ar...
In this paper I shall try to review some results which were obtained in the area of factorizations a...
In this paper I shall try to review some results which were obtained in the area of factorizations a...
A transitive decomposition of a graph is a partition of the edge set together with a group of automo...
The concept of a strong difference family formally introduced in Buratti [J Combin Designs 7 (1999),...
The concept of a strong difference family formally introduced in Buratti [J Combin Designs 7 (1999),...
AbstractA transitive decomposition of a graph is a partition of the edge set together with a group o...
AbstractThe generalized Petersen graphs (GPGs) which have been invented by Watkins, may serve for pe...
In some recent papers the method of partial differences introduced by the author [4] was very helpfu...
A finite graph Gamma is G-symmetric if it admits G as a group of automorphisms acting transitively o...
A bowtie is a graph consisting of two 3-cycles sharing a vertex. A kite is a connected graph consist...
A bowtie is a graph consisting of two 3-cycles sharing a vertex. A kite is a connected graph consist...
A finite graph Gamma is G-symmetric if it admits G as a group of automorphisms acting transitively o...