{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:37Z","timestamp":1759637977534},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,6,23]],"date-time":"2013-06-23T00:00:00Z","timestamp":1371945600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10878-013-9642-8","type":"journal-article","created":{"date-parts":[[2013,6,22]],"date-time":"2013-06-22T06:55:39Z","timestamp":1371884139000},"page":"174-187","source":"Crossref","is-referenced-by-count":9,"title":["On the complexity of partitioning a graph into a few connected subgraphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Julien","family":"Bensmail","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,6,23]]},"reference":[{"issue":"3","key":"9642_CR1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0166-218X(00)00322-X","volume":"119","author":"D Barth","year":"2002","unstructured":"Barth D, Baudon O, Puech J (2002) Decomposable trees: a polynomial algorithm for tripodes. Discret Appl Math 119(3):205\u2013216","journal-title":"Discret Appl Math"},{"issue":"5","key":"9642_CR2","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/j.disc.2006.01.006","volume":"306","author":"D Barth","year":"2006","unstructured":"Barth D, Fournier H (2006) A degree bound on decomposable trees. Discret Math 306(5):469\u2013477","journal-title":"Discret Math"},{"key":"9642_CR3","unstructured":"Baudon O, Bensmail J, Przyby\u0142o J, Wo\u017aniak M (2012) Partitioning powers of traceable or Hamiltonian graphs (Preprint). http:\/\/hal.archives-ouvertes.fr\/hal-00687278"},{"key":"9642_CR4","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0166-218X(85)90008-3","volume":"10","author":"ME Dyer","year":"1985","unstructured":"Dyer ME, Frieze AM (1985) On the complexity of partitioning graphs into connected subgraphs. Discret Appl Math 10:139\u2013153","journal-title":"Discret Appl Math"},{"issue":"2","key":"9642_CR5","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1006\/jagm.1996.0848","volume":"24","author":"N Guttmann-Beck","year":"1997","unstructured":"Guttmann-Beck N, Hassin R (1997) Approximation algorithms for min\u2013max tree partition. J Algorithms 24(2):266\u2013286","journal-title":"J Algorithms"},{"key":"9642_CR6","unstructured":"Gy\u00f6ri E (1978) On division of graphs to connected subgraphs. In: Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), vol I, pp 485\u2013494, Colloq Math Soc J\u00e1nos Bolyai, 18, North-Holland, Amsterdam."},{"key":"9642_CR7","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz L (1977) A homology theory for spanning trees of a graph. Acta Math Acad Sci Hung 30(3\u20134): 241\u2013251","DOI":"10.1007\/BF01896190"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9642-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9642-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9642-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:21Z","timestamp":1559262201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9642-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,23]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9642"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9642-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,23]]}}}