Abstract
We give a sufficient condition, which guarantees that for arbitrary Hamiltonian cycle C, there exists a [k,k + 1]-factor containing C. This improves a previous result of Cai, Li, and Kano [7].
This work is partially supported by Shandong Provincial Tai-Shan Scholar Award (2010-2015) and NASA Mississippi Space Grant Consortium No. NNG05GJ72H.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akiyama, J., Kano, M.: Factors and Factorizations of Graphs (2007) (online manuscript)
Alon, N., Bruck, J., Naor, J., Naor, M., Roth, R.: Construction of asymptotically good, low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory 38, 509–516 (1992)
Alon, N., Luby, M.: A linear time erasure-resilient code with nearly optimal recovery. IEEE Transactions on Information Theory 42 (1996)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. MacMillan, London (1976)
Cai, M., Fang, Q., Li, Y.: Hamiltonian [k,k + 1]-factor. Advances in Mathematics 32, 722–726 (2003)
Cai, M., Fang, Q., Li, Y.: Existence of Hamiltonial k-factors. J. Sys. Sci. Complexity 17(4), 464–471 (2004)
Cai, M., Li, Y., Kano, M.: A [k,k + 1]-factor containing given Hamiltonian cycle. Science in China Ser. A 41, 933–938 (1998)
Fan, G.: New sufficient conditions for cycles in graphs. J. Comb. Theory Ser. B 37, 221–227 (1984)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Books in Mathematical Sciences. W.H. Freeman, New York (1979)
Goodrich, M., Nelson, M., Sun, J.: The rainbow skip graph: A fault-tolerant constant-degree distributed data structure. In: Proceedings of The 17th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006 (2006)
Kano, M.: Some current results and problems on factors of graphs. In: Proc. 3rd China-USA Internet Coof. on Combinatorics, Graph Theory, Algorithm and Applications, Beijing, China (1993)
Liu, G.: On covered (g, f)-covered graphs. Acta Math. Scientia 8, 181–184 (1988)
Liu, G.: (g, f)-factors and factorizations in graphs. Acta Math. Sinica 37, 230–237 (1994)
Lovász, L.: Subgraphs with prescribed valencies. J. Comb. Theory Ser. B 9, 391–416 (1970)
Ore, O.: Note on Hamilton circuits. Amer. Math. Monthly 67, 55 (1960)
Tutte, W.T.: The factorization of linear graphs. J. London Math. Soc. 22, 107–111 (1947)
Tutte, W.T.: The factors of graphs. Can. J. Math. 4, 314–328 (1952)
Wei, B., Zhu, Y.: Hamiltonian k-factors in graphs. J. Graph Theory 25, 217–227 (1997)
Yu, J., Liu, G., Cao, B.: Connected factors of graphs. OR Transactions 9(1) (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, G., Pan, X., Sun, J.Z. (2010). A New Result on [k,k + 1]-Factors Containing Given Hamiltonian Cycles. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17461-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-17461-2_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17460-5
Online ISBN: 978-3-642-17461-2
eBook Packages: Computer ScienceComputer Science (R0)