Cyclic and dihedral 1-factorizations of multipartite graphs

From MaRDI portal
Publication:640435

zbMATH Open1231.05121arXiv1210.1078MaRDI QIDQ640435FDOQ640435


Authors: Mathieu Bogaerts, G. Mazzuoccolo Edit this on Wikidata


Publication date: 18 October 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: An automorphism group G of a 1-factorization of the complete multipartite graph Kmimesn consists in permutations of the vertices of the graph mapping factors to factors. In this paper, we give a complete answer to the existence or non-existence problem of a 1-factorization of Kmimesn admitting an abelian group acting sharply transitively on the vertices of the graph.


Full work available at URL: https://arxiv.org/abs/1210.1078

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (11)





This page was built for publication: Cyclic and dihedral 1-factorizations of multipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640435)