Abstract
A 4-semiregular 1-factorization is a 1-factorization in which every pair of distinct 1-factors forms a union of 4-cycles. LetK be the complete graphK 2nor the complete bipartite graphK n, n .We prove that there is a 4-semiregular 1-factorization ofK if and only ifn is a power of 2 andn≥2, and 4-semiregular 1-factorizations ofK are isomorphic, and then we determine the symmetry groups. They are known for the case of the complete graphK 2n ,however, we prove them in a different method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.References
Cameron, P.J.: Parallelisms of Complete Designs. London Math. Soc. Lecture Note Ser. 23. Cambridge: Cambridge Univ. Press 1976
Mendelsohn, E., Rosa, A.: One-Factorizations of the Complete Graph — A Survey. J. Graph Theory9, 43–65 (1985)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kobayashi, M., Nakamura, G. On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs. Graphs and Combinatorics 10, 53–59 (1994). https://doi.org/10.1007/BF01202470
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01202470