Cyclic and dihedral 1-factorizations of multipartite graphs
The electronic journal of combinatorics, Tome 18 (2011) no. 1
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.
DOI :
10.37236/666
Classification :
05C25, 05C70
Mots-clés : multipartite graphs, \(r\)-factor, perfect matching
Mots-clés : multipartite graphs, \(r\)-factor, perfect matching
@article{10_37236_666,
author = {Mathieu Bogaerts and Giuseppe Mazzuoccolo},
title = {Cyclic and dihedral 1-factorizations of multipartite graphs},
journal = {The electronic journal of combinatorics},
year = {2011},
volume = {18},
number = {1},
doi = {10.37236/666},
zbl = {1231.05121},
url = {http://geodesic.mathdoc.fr/articles/10.37236/666/}
}
Mathieu Bogaerts; Giuseppe Mazzuoccolo. Cyclic and dihedral 1-factorizations of multipartite graphs. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/666
Cité par Sources :