{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:20:32Z","timestamp":1725571232565},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174605"},{"type":"electronic","value":"9783642174612"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17461-2_14","type":"book-chapter","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T09:53:59Z","timestamp":1292406839000},"page":"170-180","source":"Crossref","is-referenced-by-count":0,"title":["A New Result on [k,k\u2009+\u20091]-Factors Containing Given Hamiltonian Cycles"],"prefix":"10.1007","author":[{"given":"Guizhen","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuejun","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan Z.","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Akiyama, J., Kano, M.: Factors and Factorizations of Graphs (2007) (online manuscript)"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/18.119713","volume":"38","author":"N. Alon","year":"1992","unstructured":"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\u00a038, 509\u2013516 (1992)","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Luby, M.: A linear time erasure-resilient code with nearly optimal recovery. IEEE Transactions on Information Theory\u00a042 (1996)","DOI":"10.1109\/18.556669"},{"key":"14_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. MacMillan, London (1976)"},{"key":"14_CR5","first-page":"722","volume":"32","author":"M. Cai","year":"2003","unstructured":"Cai, M., Fang, Q., Li, Y.: Hamiltonian [k,k\u2009+\u20091]-factor. Advances in Mathematics\u00a032, 722\u2013726 (2003)","journal-title":"Advances in Mathematics"},{"issue":"4","key":"14_CR6","first-page":"464","volume":"17","author":"M. Cai","year":"2004","unstructured":"Cai, M., Fang, Q., Li, Y.: Existence of Hamiltonial k-factors. J. Sys. Sci. Complexity\u00a017(4), 464\u2013471 (2004)","journal-title":"J. Sys. Sci. Complexity"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1007\/BF02880002","volume":"41","author":"M. Cai","year":"1998","unstructured":"Cai, M., Li, Y., Kano, M.: A [k,k\u2009+\u20091]-factor containing given Hamiltonian cycle. Science in China Ser. A\u00a041, 933\u2013938 (1998)","journal-title":"Science in China Ser. A"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0095-8956(84)90054-6","volume":"37","author":"G. Fan","year":"1984","unstructured":"Fan, G.: New sufficient conditions for cycles in graphs. J. Comb. Theory Ser. B\u00a037, 221\u2013227 (1984)","journal-title":"J. Comb. Theory Ser. B"},{"key":"14_CR9","series-title":"Books in Mathematical Sciences","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"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)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1109557.1109601"},{"key":"14_CR11","unstructured":"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)"},{"key":"14_CR12","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0252-9602(18)30297-2","volume":"8","author":"G. Liu","year":"1988","unstructured":"Liu, G.: On covered (g, f)-covered graphs. Acta Math. Scientia\u00a08, 181\u2013184 (1988)","journal-title":"Acta Math. Scientia"},{"key":"14_CR13","first-page":"230","volume":"37","author":"G. Liu","year":"1994","unstructured":"Liu, G.: (g, f)-factors and factorizations in graphs. Acta Math. Sinica\u00a037, 230\u2013237 (1994)","journal-title":"Acta Math. Sinica"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/S0021-9800(70)80033-3","volume":"9","author":"L. Lov\u00e1sz","year":"1970","unstructured":"Lov\u00e1sz, L.: Subgraphs with prescribed valencies. J. Comb. Theory Ser. B\u00a09, 391\u2013416 (1970)","journal-title":"J. Comb. Theory Ser. B"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"55","DOI":"10.2307\/2308928","volume":"67","author":"O. Ore","year":"1960","unstructured":"Ore, O.: Note on Hamilton circuits. Amer. Math. Monthly\u00a067, 55 (1960)","journal-title":"Amer. Math. Monthly"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"W.T. Tutte","year":"1947","unstructured":"Tutte, W.T.: The factorization of linear graphs. J. London Math. Soc.\u00a022, 107\u2013111 (1947)","journal-title":"J. London Math. Soc."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"W.T. Tutte","year":"1952","unstructured":"Tutte, W.T.: The factors of graphs. Can. J. Math.\u00a04, 314\u2013328 (1952)","journal-title":"Can. J. Math."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/(SICI)1097-0118(199707)25:3<217::AID-JGT5>3.0.CO;2-O","volume":"25","author":"B. Wei","year":"1997","unstructured":"Wei, B., Zhu, Y.: Hamiltonian k-factors in graphs. J. Graph Theory\u00a025, 217\u2013227 (1997)","journal-title":"J. Graph Theory"},{"key":"14_CR19","unstructured":"Yu, J., Liu, G., Cao, B.: Connected factors of graphs. OR Transactions\u00a09(1) (2005)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17461-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T20:03:54Z","timestamp":1553285034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17461-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174605","9783642174612"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17461-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}