AbstractA homogeneous factorisation of a graph is a partition of its arc set such that there exist vertex transitive subgroups M<G⩽Aut(Γ) with M fixing each part of the partition setwise and G preserving the partition and transitively permuting the parts. In this paper we study homogeneous factorisations of complete multipartite graphs such that M acts regularly on vertices. We provide a necessary and sufficient condition for the existence of such factorisations and produce many interesting examples. In particular we give a complete determination of the parameters for which homogeneous factorisations exist with M cyclic
AbstractA graph Γ is k-CS-transitive, for a positive integer k, if for any two connected isomorphic ...
We investigate the properties of graphs which are homogeneous in the sense of Fraisse when consider...
A distinguishing partition of a set X with automorphism group aut(X) is a partition of X that is fix...
AbstractA homogeneous factorisation of a graph is a partition of its arc set such that there exist v...
AbstractA homogeneous factorisation (M,G,Γ,P) is a partition P of the arc set of a digraph Γ such th...
This thesis concerns the study of homogeneous factorisations of complete graphs with edge-transitive...
AbstractA homogeneous factorisation of a digraph Γ consists of a partition P={P1,…,Pk} of the arc se...
For a graph Γ, subgroups M < G 6 Aut(Γ), and an edge partition E of Γ, the pair (Γ, E) is a (G,M)...
A homogeneous factorisation of a digraph Γ consists of a partition P = {P1,..., Pk} of the arc set A...
AbstractIn this paper we determine the positive integers n and k for which there exists a homogeneou...
In this paper I shall try to review some results which were obtained in the area of factorizations a...
AbstractLet k, ℓ be positive integers. Let G be a graph of order kℓ. It is shown that if G is a comp...
AbstractA graph is called almost self-complementary if it is isomorphic to the graph obtained from i...
AbstractA graph is connected-homogeneous if any isomorphism between finite connected induced subgrap...
A finite graph $\G$ is said to be {\em $(G,3)$-$($connected$)$ homogeneous} if every isomorphism bet...
AbstractA graph Γ is k-CS-transitive, for a positive integer k, if for any two connected isomorphic ...
We investigate the properties of graphs which are homogeneous in the sense of Fraisse when consider...
A distinguishing partition of a set X with automorphism group aut(X) is a partition of X that is fix...
AbstractA homogeneous factorisation of a graph is a partition of its arc set such that there exist v...
AbstractA homogeneous factorisation (M,G,Γ,P) is a partition P of the arc set of a digraph Γ such th...
This thesis concerns the study of homogeneous factorisations of complete graphs with edge-transitive...
AbstractA homogeneous factorisation of a digraph Γ consists of a partition P={P1,…,Pk} of the arc se...
For a graph Γ, subgroups M < G 6 Aut(Γ), and an edge partition E of Γ, the pair (Γ, E) is a (G,M)...
A homogeneous factorisation of a digraph Γ consists of a partition P = {P1,..., Pk} of the arc set A...
AbstractIn this paper we determine the positive integers n and k for which there exists a homogeneou...
In this paper I shall try to review some results which were obtained in the area of factorizations a...
AbstractLet k, ℓ be positive integers. Let G be a graph of order kℓ. It is shown that if G is a comp...
AbstractA graph is called almost self-complementary if it is isomorphic to the graph obtained from i...
AbstractA graph is connected-homogeneous if any isomorphism between finite connected induced subgrap...
A finite graph $\G$ is said to be {\em $(G,3)$-$($connected$)$ homogeneous} if every isomorphism bet...
AbstractA graph Γ is k-CS-transitive, for a positive integer k, if for any two connected isomorphic ...
We investigate the properties of graphs which are homogeneous in the sense of Fraisse when consider...
A distinguishing partition of a set X with automorphism group aut(X) is a partition of X that is fix...