par Devillers, Alice ;Giudici, Michael;Li, Cai Heng;Praeger, Cheryl E.
Référence Journal of combinatorial theory. Series A, 115, 6, page (925-966)
Publication Publié, 2008
Article révisé par les pairs
Résumé : A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all transitive decompositions of the Johnson graphs such that the group preserving the partition is arc-transitive and acts primitively on the parts. © 2008 Elsevier Inc. All rights reserved.