{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:32:48Z","timestamp":1742995968316,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319202969"},{"type":"electronic","value":"9783319202976"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20297-6_23","type":"book-chapter","created":{"date-parts":[[2015,6,22]],"date-time":"2015-06-22T01:55:05Z","timestamp":1434938105000},"page":"350-363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Approximation and Exact Algorithms for Special Cases of Connected f-Factors"],"prefix":"10.1007","author":[{"given":"N. S.","family":"Narayanaswamy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. S.","family":"Rahul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,23]]},"reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/0196-6774(85)90022-7","volume":"6","author":"RP Anstee","year":"1985","unstructured":"Anstee, R.P.: An algorithmic proof of tutte\u2019s f-factor theorem. J. Algorithms 6(1), 112\u2013131 (1985)","journal-title":"J. Algorithms"},{"issue":"1\u20132","key":"23_CR2","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0166-218X(90)90129-Z","volume":"27","author":"F Cheah","year":"1990","unstructured":"Cheah, F., Corneil, D.G.: The complexity of regular subgraph recognition. Discrete Appl. Math. 27(1\u20132), 59\u201368 (1990)","journal-title":"Discrete Appl. Math."},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/978-3-319-08001-7_11","volume-title":"Approximation and Online Algorithms","author":"K Cornelissen","year":"2014","unstructured":"Cornelissen, K., Hoeksma, R., Manthey, B., Narayanaswamy, N.S., Rahul, C.S.: Approximability of connected factors. In: Kaklamanis, C., Pruhs, K. (eds.) WAOA 2013. LNCS, vol. 8447, pp. 120\u2013131. Springer, Heidelberg (2014)"},{"issue":"2","key":"23_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0095-8956(88)90068-8","volume":"45","author":"G Cornu\u00e9jols","year":"1988","unstructured":"Cornu\u00e9jols, G.: General factors of graphs. J. Comb. Theory, Ser. B 45(2), 185\u2013198 (1988)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"23_CR5","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2012)","edition":"4"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"s3\u20132","author":"GA Dirac","year":"1952","unstructured":"Dirac, G.A.: Some theorems on abstract graphs. Proc. London Math. Soc. s3\u20132(1), 69\u201381 (1952)","journal-title":"Proc. London Math. Soc."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1 vertices. J. Res. Natl. Bur. Stand. 69B, 125\u2013130 (1965)","journal-title":"J. Res. Natl. Bur. Stand."},{"issue":"3","key":"23_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canadian J. Math. 17(3), 449\u2013467 (1965)","journal-title":"Canadian J. Math."},{"issue":"4","key":"23_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01787640","volume":"7","author":"T Iida","year":"1991","unstructured":"Iida, T., Nishimura, T.: An ore-type condition for the existence of k-factors in graphs. Graphs Comb. 7(4), 353\u2013361 (1991)","journal-title":"Graphs Comb."},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"s1\u201336","author":"CStJA Nash-Williams","year":"1961","unstructured":"Nash-Williams, CStJA: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. s1\u201336(1), 445\u2013450 (1961)","journal-title":"J. London Math. Soc."},{"key":"23_CR11","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. American Math. Monthly 67, 55 (1960)","journal-title":"American Math. Monthly"},{"issue":"7","key":"23_CR12","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.disc.2005.11.059","volume":"307","author":"MD Plummer","year":"2007","unstructured":"Plummer, M.D.: Graph factors and factorization: 1985\u20132003: a survey. Discrete Math. 307(7), 791\u2013821 (2007)","journal-title":"Discrete Math."},{"issue":"13","key":"23_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0012-365X(99)00113-2","volume":"207","author":"T Tokuda","year":"1999","unstructured":"Tokuda, T.: Connected [a, b]-factors in k$$_{1, n}$$-free graphs containing an [a, b]-factor. Discrete Math. 207(13), 293\u2013298 (1999)","journal-title":"Discrete Math."},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"638","DOI":"10.2307\/2319893","volume":"83","author":"A Tucker","year":"1976","unstructured":"Tucker, A.: A new applicable proof of the euler circuit theorem. American Math. Monthly 83, 638\u2013640 (1976)","journal-title":"American Math. Monthly"},{"issue":"3","key":"23_CR15","doi-asserted-by":"publisher","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"WT Tutte","year":"1952","unstructured":"Tutte, W.T.: The factors of graphs. Canadian J. Math. 4(3), 314\u2013328 (1952)","journal-title":"Canadian J. Math."},{"issue":"1954","key":"23_CR16","doi-asserted-by":"publisher","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","volume":"6","author":"WT Tutte","year":"1954","unstructured":"Tutte, W.T.: A short proof of the factor theorem for finite graphs. Canadian J. Math. 6(1954), 347\u2013352 (1954)","journal-title":"Canadian J. Math."},{"issue":"1","key":"23_CR17","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"s1\u201336","author":"WT Tutte","year":"1961","unstructured":"Tutte, W.T.: On the problem of decomposing a graph into n connected factors. J. London Math. Soc. s1\u201336(1), 221\u2013230 (1961)","journal-title":"J. London Math. Soc."},{"issue":"1","key":"23_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-004-0587-7","volume":"21","author":"PD Vestergaard","year":"2005","unstructured":"Vestergaard, P.D., Kouider, M.: Connected factors in graphs - a survey. Graphs Comb. 21(1), 1\u201326 (2005)","journal-title":"Graphs Comb."},{"key":"23_CR19","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, New Delhi (2001)"},{"key":"23_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DB Williamson","year":"2011","unstructured":"Williamson, D.B., Shmoys, P.D.: The Design of Approximation Algorithms. Cambridge University Press, New York (2011)"}],"container-title":["Lecture Notes in Computer Science","Computer Science -- Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20297-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:50:45Z","timestamp":1676944245000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20297-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319202969","9783319202976"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20297-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"23 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}