{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:33Z","timestamp":1759063533769,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2010,5,29]],"date-time":"2010-05-29T00:00:00Z","timestamp":1275091200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s00373-010-0953-6","type":"journal-article","created":{"date-parts":[[2010,5,28]],"date-time":"2010-05-28T03:34:05Z","timestamp":1275017645000},"page":"805-813","source":"Crossref","is-referenced-by-count":9,"title":["Binding Numbers and Connected Factors"],"prefix":"10.1007","volume":"26","author":[{"given":"Yunsun","family":"Nam","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,5,29]]},"reference":[{"key":"953_CR1","first-page":"165","volume":"A81","author":"C. Berge","year":"1978","unstructured":"Berge C., Las Vergnas M.: On the existence of subgraphs with degree constraints. Proc. Konink. Nederi. Akad. Wet. Amsterdam A81, 165\u2013176 (1978)","journal-title":"Proc. Konink. Nederi. Akad. Wet. Amsterdam"},{"key":"953_CR2","doi-asserted-by":"crossref","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. North Holland, NY (1976)"},{"key":"953_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(95)00328-T","volume":"169","author":"M. Cai","year":"1997","unstructured":"Cai M.: Connected [k , k\u00a0+\u00a01]-factors of graphs. Discrete Math. 169, 1\u201316 (1997)","journal-title":"Discrete Math."},{"key":"953_CR4","doi-asserted-by":"crossref","unstructured":"Cai, M., Kano, M., Li, Y.: A [k, k+1]-factor containing a given Hamiltonian cycle. Electron. J. Combin. 6, #R4 (1999)","DOI":"10.37236\/1436"},{"key":"953_CR5","first-page":"141","volume":"5","author":"C. Chen","year":"1992","unstructured":"Chen C.: Remarks on the binding number for [a, b]-factors. J. Syst. Sci. Math. Sci. 5, 141\u2013145 (1992)","journal-title":"J. Syst. Sci. Math. Sci."},{"key":"953_CR6","first-page":"179","volume":"6","author":"C. Chen","year":"1993","unstructured":"Chen C.: Binding number and minimum degree for [a, b]-factors. J. Syst. Sci. Math. Sci. 6, 179\u2013185 (1993)","journal-title":"J. Syst. Sci. Math. Sci."},{"key":"953_CR7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/(SICI)1097-0118(200003)33:3<125::AID-JGT1>3.0.CO;2-X","volume":"33","author":"M.N. Ellingham","year":"2000","unstructured":"Ellingham M.N., Zha X.: Toughness, trees and walks. J. Graph Theory 33, 125\u2013137 (2000)","journal-title":"J. Graph Theory"},{"key":"953_CR8","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1002\/jgt.10019","volume":"39","author":"M.N. Ellingham","year":"2002","unstructured":"Ellingham M.N., Nam Y., Voss H.-J.: Connected (g, f)-factors. J. Graph Theory 39, 62\u201375 (2002)","journal-title":"J. Graph Theory"},{"key":"953_CR9","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. W. H. Freeman, San Francisco (1979)"},{"key":"953_CR10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1093\/qmath\/38.2.221","volume":"38","author":"P. Katerinis","year":"1987","unstructured":"Katerinis P., Woodall D.R.: The binding numbers of graphs and the existence of k-factors. Q. J. Math. 38, 221\u2013228 (1987)","journal-title":"Q. J. Math."},{"key":"953_CR11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s004930200004","volume":"22","author":"M. Kouider","year":"2002","unstructured":"Kouider M., Mah\u00e9o M.: Connected [a, b]-factors in graphs. Combinatorica 22, 71\u201382 (2002)","journal-title":"Combinatorica"},{"key":"953_CR12","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/jgt.20253","volume":"56","author":"Y. Nam","year":"2007","unstructured":"Nam Y.: An ore-type condition for the existence of connected factors. J. Graph Theory 56, 241\u2013248 (2007)","journal-title":"J. Graph Theory"},{"key":"953_CR13","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1002\/jgt.3190130511","volume":"13","author":"N. Tokushige","year":"1989","unstructured":"Tokushige N.: Binding number and minimum degree for k-factors. J. Graph Theory 13, 607\u2013617 (1989)","journal-title":"J. Graph Theory"},{"key":"953_CR14","doi-asserted-by":"crossref","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 25, 217\u2013227 (1997)","journal-title":"J. Graph Theory"},{"key":"953_CR15","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02995957","volume":"43","author":"S. Win","year":"1975","unstructured":"Win S.: Existenz von Gerusten mit Vorgeschriebenem Maximalgrad in Graphen. Abh. Math. Sem. Univ. Hamburg 43, 263\u2013267 (1975)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"953_CR16","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/PL00021186","volume":"14","author":"B. Xu","year":"1998","unstructured":"Xu B., Liu Z., Tokuda T.: Connected factors in K 1,n -free graphs containing a (g, f)-factor. Graphs Combin. 14, 393\u2013395 (1998)","journal-title":"Graphs Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0953-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0953-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0953-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T08:47:50Z","timestamp":1740127670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0953-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,29]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["953"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0953-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2010,5,29]]}}}