Abstract
Letk⩾2 be an integer and let G be a graph of ordern with minimum degree at leastk, n⩾8k -16 for evenn and n⩾6k - 13 for oddn. If the degree sum of each pair of nonadjacent vertices of G is at least n, then for any given Hamiltonian cycleC. G has a [k, k + 1]-factor containingC
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bondy, J.A., Murty, U.S.R.,Graph Theory with Applications, New York: Elsevier, 1976.
Iida, T., Nishimura, T., An ore-type condition for the existence of k-factors in graphs,Graphs and Combinat., 1991, 7: 353.
Nishimura, T., A degree condition for the existence of k-factors,J. Graph Theory, 1992, 16: 141.
Kano, K., Some current results and problems on factors of graphs, inProc. 3rd China-USA Internat. Conf. on Combinatorics, Graph Theory, Algorithms and Applications, Beijing, 1993 (eds. Alavi, Y., Lick, D.R., Liu, J.), River Edge: World Sci. Publishing, 1994, 93.
Cai Mao-cheng, A degree condition for the existence of connected[k, k + 1]-factors,J. Sys. Sci. & Math. Scis., 1995, 8: 164.
Cai Mao-cheng, Connected [k, k+ 1]-factors of graphs,Discrete Math., 1997, 169: 1.
Lovász, L., Subgraphs with prescribed valencies,J. Combin. Theory, 1970, 8: 391.
Author information
Authors and Affiliations
Additional information
Preject supported partially by an exchange program between the Chinese Academy of Sciences and the Japan Society for Promotion of Sciences and by the National Natural Science Foundation of China (Grant No. 19136012)
Rights and permissions
About this article
Cite this article
Cai, M., Li, Y. & Kano, M. A [k,k+1]-factor containing given Hamiltonian cycle. Sci. China Ser. A-Math. 41, 933–938 (1998). https://doi.org/10.1007/BF02880002
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02880002