Abstract
The perfect 1-factorization conjecture by A. Kotzig [7] asserts the existence of a 1-factorization of a complete graph K 2n in which any two 1-factors induce a Hamiltonian cycle. This conjecture is one of the prominent open problems in graph theory.Apart from its theoretical significance it has a number of applications, particularly in designing topologies for wireless communication.Recently, a weaker version of this conjecture has been proposed in [1] for the case of semi-perfect 1-factorizations. A semi-perfect 1-factorization is a decomposition of a graph G into distinct 1-factors F 1, ..., F k such that F 1∪ F i forms a Hamiltonian cycle for any 1 < i ≤ k.We show that complete graphs K 2n , hypercubes Q 2n + 1 and tori T 2n × 2n admit a semi-perfect 1-factorization.
Supported in part by grant APVT-20-018902.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Archdeacon, D.: Problems in Topological Graph Theory, http://www.emba.uvm.edu/~archdeac/problems/perfectq.htm
Aubert, J., Schneider, B.: Decompositions de la somme cartsienne d’un cycle et l’union de deux cycles hamiltoniens en cycles hamiltoniens. Discrete Mathematics 38, 7–16 (1982)
Baatz, S., et al.: Building Efficient Bluetooth Scatternet Topologies from 1-Factors. In: Proc. IASTED International Conference on Wireless and Optical Communications, WOC 2002, Banff, Alberta, Canada, July 2002, pp. 300–305 (2002)
Bass, D.W., Sudborough, I.H.: Hamilton Decompositions and (n/2)-Factorizations of Hypercubes. Journal of Graph Algorithms and Applications 7, 79–98 (2003)
Craft, D.: On the genus of joins and compositions of graphs. Discrete Mathematics 178, 25–50 (1998)
Craft, D.: Private communication
Kotzig, A.: Hamilton graphs and Hamilton circuits Theory of Graphs and its Applications. In: Proceedings of the Symposium of Smolenice, 1963 Nakl. ČSAV Praha, pp. 62–82 (1964)
Mendelsohn, E., Rosa, A.: One-Factorizations of the Complete Graph – a Survey. Journal of Graph Theory 9, 43–65 (1985)
Okuda, K., Song, S.W.: Revisiting Hamiltonian Decomposition of the Hypercube. In: Proc. XIII Symposium on Integrated Circuits and System Design, SBCCI 2000, Manaus, Brazil, September 2000, pp. 55–60 (2000)
Pike, D.A.: Hamiltonian decompositions of line graphs of perfectly 1-factorizable graphs of even degree Australian. Journal of Combinatorics 12, 291–294 (1995)
Tillson, T.: A Hamiltonian decomposition of K 2n , 2n ≥ 8. J. Combin. Theory Ser. B 29, 68–74 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Královič, R., Královič, R. (2005). On Semi-perfect 1-Factorizations. In: Pelc, A., Raynal, M. (eds) Structural Information and Communication Complexity. SIROCCO 2005. Lecture Notes in Computer Science, vol 3499. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11429647_18
Download citation
DOI: https://doi.org/10.1007/11429647_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26052-3
Online ISBN: 978-3-540-32073-9
eBook Packages: Computer ScienceComputer Science (R0)