{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:37Z","timestamp":1759638277551},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206958"},{"type":"electronic","value":"9783540245872"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24587-2_46","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:59:19Z","timestamp":1280393959000},"page":"444-453","source":"Crossref","is-referenced-by-count":10,"title":["On the Existence and Determination of Satisfactory Partitions in a Graph"],"prefix":"10.1007","author":[{"given":"Cristina","family":"Bazgan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Vanderpooten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"46_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1142\/S0129054194000049","volume":"5","author":"H.L. Bodlaender","year":"1994","unstructured":"Bodlaender, H.L.: On disjoint cycles. International Journal of Foundations of Computer Science\u00a05(1), 59\u201368 (1994)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"46_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/jgt.3190080106","volume":"8","author":"V. Chv\u00e1tal","year":"1984","unstructured":"Chv\u00e1tal, V.: Recognizing decomposable graphs. Journal of Graph Theory\u00a08, 51\u201353 (1984)","journal-title":"Journal of Graph Theory"},{"key":"46_CR3","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0377-2217(99)00459-2","volume":"125","author":"M. Gerber","year":"2000","unstructured":"Gerber, M., Kobler, D.: Algorithmic approach to the satisfactory graph partitioning problem. European Journal of Operation Research\u00a0125, 283\u2013291 (2000)","journal-title":"European Journal of Operation Research"},{"key":"46_CR4","unstructured":"Lov\u00e1sz, L.: Coverings and coloring of hypergraphs. In: Proceedings of 4th Southeastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, Winnipeg, pp. 3\u201312 (1973)"},{"key":"46_CR5","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1002\/(SICI)1097-0118(199611)23:3<321::AID-JGT12>3.0.CO;2-H","volume":"23","author":"M. Stiebitz","year":"1996","unstructured":"Stiebitz, M.: Decomposing graphs under degree constraints. Journal of Graph Theory\u00a023, 321\u2013324 (1996)","journal-title":"Journal of Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24587-2_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:48:07Z","timestamp":1558298887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24587-2_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206958","9783540245872"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24587-2_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}