TY - JOUR
T1 - Constructing Homogeneous Factorisations of Complete Graphs and Digraphs
AU - Li, Cai-Heng
AU - Praeger, Cheryl
PY - 2002
Y1 - 2002
N2 - A homogeneous factorisation of a complete graph K, is a partition of the edge set that is invariant under a subgroup G of S, such that G is transitive on the parts of the partition and induces a vertex-transitive automorphism group on the graph corresponding to each part. A product construction is given for such factorisations.
AB - A homogeneous factorisation of a complete graph K, is a partition of the edge set that is invariant under a subgroup G of S, such that G is transitive on the parts of the partition and induces a vertex-transitive automorphism group on the graph corresponding to each part. A product construction is given for such factorisations.
UR - https://www.scopus.com/pages/publications/0036973035
U2 - 10.1007/s003730200061
DO - 10.1007/s003730200061
M3 - Article
SN - 0911-0119
VL - 18
SP - 757
EP - 761
JO - Graphs and Combinatorics
JF - Graphs and Combinatorics
ER -