Abstract
A transitive decomposition of a graph is a partition of the edge or arc set giving a set of subgraphs which are preserved and permuted transitively by a group of automorphisms of the graph. This paper deals with transitive decompositions of complete multipartite graphs preserved by an imprimitive rank 3 permutation group. We obtain a near-complete classification of these when the group in question has an almost simple component. © 2011 Springer.
| Original language | English |
|---|---|
| Pages (from-to) | 669-680 |
| Journal | Graphs and Combinatorics |
| Volume | 29 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2013 |