Cyclic and Dihedral 1-Factorizations of Multipartite Graphs

  • Mathieu Bogaerts
  • Giuseppe Mazzuoccolo
DOI: https://doi.org/10.37236/666

Abstract

An automorphism group $G$ of a $1$-factorization of the complete multipartite graph $K_{m\times 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\times n}$ admitting a cyclic or dihedral group acting sharply transitively on the vertices of the graph.

Published
2011-09-09
Issue
Volume 18, Issue 1 (2011)
Article Number
P179