Cyclic and dihedral 1-factorizations of multipartite graphs
From MaRDI portal
(Redirected from Publication:640435)
Abstract: An automorphism group G of a 1-factorization of the complete multipartite graph 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 admitting an abelian group acting sharply transitively on the vertices of the graph.
Recommendations
- Sharply transitive 1-factorizations of complete multipartite graphs
- One-factorizations of complete graphs with vertex-regular automorphism groups
- Abelian 1-factorizations of the complete graph
- Homogeneous factorisations of complete multipartite graphs
- Symmetric 1-factorizations of the complete graph
Cited in
(12)- One-factorizations of complete graphs with vertex-regular automorphism groups
- Abelian 1-factorizations of the complete graph
- Cyclic one-factorization of the complete graph
- On transitive one-factorizations of arc-transitive graphs
- Regular \(1\)-factorizations of complete graphs and decompositions into pairwise isomorphic rainbow spanning trees
- Vertex‐regular 1‐factorizations in infinite graphs
- On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching
- Sharply transitive 1-factorizations of complete multipartite graphs
- Primitive one-factorizations and the geometry of mixed translations
- Symmetric 1-factorizations of the complete graph
- Complete multipartite graphs which are isomorphic to elementary abelian \(p\)-group Cayley homogeneous factorization
- scientific article; zbMATH DE number 6928815 (Why is no real title available?)
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)