{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T03:45:09Z","timestamp":1773891909570,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,2,1]],"date-time":"1985-02-01T00:00:00Z","timestamp":476064000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10393,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1985,2]]},"DOI":"10.1016\/0166-218x(85)90008-3","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T22:04:08Z","timestamp":1034287448000},"page":"139-153","source":"Crossref","is-referenced-by-count":125,"title":["On the complexity of partitioning graphs into connected subgraphs"],"prefix":"10.1016","volume":"10","author":[{"given":"M.E.","family":"Dyer","sequence":"first","affiliation":[]},{"given":"A.M.","family":"Frieze","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(85)90008-3_BIB1","unstructured":"M.E. Dyer and A.M. Frieze, Planar 3DM is NP-complete, submitted for publication."},{"key":"10.1016\/0166-218X(85)90008-3_BIB2","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0166-218X(85)90008-3_BIB3","series-title":"A Guide to the Theory of NP-Completeness","article-title":"Computers and Intractability","author":"Garey","year":"1978"},{"key":"10.1016\/0166-218X(85)90008-3_BIB4","article-title":"On division of graphs to connected subgraphs","volume":"Vol. 18","author":"Gy\u00f6ri","year":"1976"},{"key":"10.1016\/0166-218X(85)90008-3_BIB5","series-title":"Proc. 5th Southeastern Conf. Combinatorics, Graph Theory and Computing","first-page":"449","article-title":"Minimum spanning forests of bounded trees","author":"Hadlock","year":"1974"},{"key":"10.1016\/0166-218X(85)90008-3_BIB6","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/0210054","article-title":"The NP-completeness of some edge-partitioning problems","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(85)90008-3_BIB7","series-title":"Research CORR 83-8","article-title":"On partitioning the edges of graphs into connected subgraphs","author":"Junger","year":"1983"},{"key":"10.1016\/0166-218X(85)90008-3_BIB8","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","article-title":"Planar satisfiability and its uses","volume":"11","author":"Lichtenstein","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(85)90008-3_BIB9","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(85)90008-3_BIB10","first-page":"240","article-title":"On the complexity of a generalised matching problem","author":"Kirkpatrick","year":"1978","journal-title":"Proc. 10th Annual ACM Symp. Theory of Computing"},{"key":"10.1016\/0166-218X(85)90008-3_BIB11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01896190","article-title":"A homology theory for spanning trees of a graph","volume":"30","author":"Lov\u00e1sz","year":"1977","journal-title":"Acta. Math. Acad. Sci. Hung."},{"key":"10.1016\/0166-218X(85)90008-3_BIB12","unstructured":"C.J.H. McDiarmid and N. Papacostas, Unpublished manuscript."},{"key":"10.1016\/0166-218X(85)90008-3_BIB13","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(81)90041-7","article-title":"The clique problem for planar graphs","volume":"13","author":"Papadimitriou","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(85)90008-3_BIB14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/322234.322236","article-title":"Max-min tree partitioning","volume":"28","author":"Perl","year":"1981","journal-title":"JACM"},{"key":"10.1016\/0166-218X(85)90008-3_BIB15","series-title":"Dynamic Information and Library Processing","author":"Salton","year":"1975"},{"key":"10.1016\/0166-218X(85)90008-3_BIB16","series-title":"Operating Systems","author":"Tschritzand","year":"1974"},{"key":"10.1016\/0166-218X(85)90008-3_BIB17","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series parallel digraphs","volume":"11","author":"Valdes","year":"1982","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900083?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900083?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:23:28Z","timestamp":1555190608000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X85900083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,2]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,2]]}},"alternative-id":["0166218X85900083"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(85)90008-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,2]]}}}