par Bogaerts, Mathieu ;Mazzuoccolo, Giuseppe
Référence The electronic journal of combinatorics, 18, 1, P179
Publication Publié, 2011-09-09
Article révisé par les pairs
Résumé : An automorphism group G of a 1-factorization of the complete multipartite graph K m×n consists of permutations of the vertices of the graph mapping factors to factors. In this paper, we give a complete answer to the existence problem of a 1-factorization of K m×n admitting a cyclic or dihedral group acting sharply transitively on the vertices of the graph.