{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T18:59:30Z","timestamp":1648753170488},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,5,17]],"date-time":"2006-05-17T00:00:00Z","timestamp":1147824000000},"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":[[2006,6]]},"DOI":"10.1007\/s10878-006-8460-7","type":"journal-article","created":{"date-parts":[[2006,5,22]],"date-time":"2006-05-22T10:21:26Z","timestamp":1148293286000},"page":"445-454","source":"Crossref","is-referenced-by-count":5,"title":["Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees"],"prefix":"10.1007","volume":"11","author":[{"given":"Zemin","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikio","family":"Kano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueliang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,17]]},"reference":[{"key":"8460_CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(94)00296-U","volume":"152","author":"A Brandstadt","year":"1996","unstructured":"Brandstadt A (1996) Partitions of graphs into one or two independent sets and cliques. Discrete Math 152:47\u201354","journal-title":"Discrete Math"},{"key":"8460_CR2","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0012-365X(00)00229-6","volume":"233","author":"H Enomoto","year":"2001","unstructured":"Enomoto H (2001) Graph partition problems into cycles and paths. Discrete Math 233:93\u2013101","journal-title":"Discrete Math"},{"key":"8460_CR3","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0095-8956(91)90007-7","volume":"51","author":"Erd\u00f6s P","year":"1991","unstructured":"Erd\u00f6s P, Gy\u00e1rf\u00e1s A, Pyber L (1991) Vertex coverings by monochromatic cycles and trees. J Combin Theory, Ser B 51:90\u201395","journal-title":"J Combin Theorys, Ser B"},{"key":"8460_CR4","doi-asserted-by":"crossref","unstructured":"Feder T, Hell P, Klein S, Motwani R (1999) Complexity of graph partition problems. Proceedings of Thirty-First Annual ACM Symposium on Theory of Computing, pp. 464\u2013472","DOI":"10.1145\/301250.301373"},{"key":"8460_CR5","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1006\/jcss.1995.1065","volume":"51","author":"T Feder","year":"1995","unstructured":"Feder T, Motwani R (1995) Clique partitions, graph compression and Speeding-Up algorithms. J Computer and System Sciences 51:261\u2013272","journal-title":"J Computer and System Sciences"},{"key":"8460_CR6","volume-title":"Computers and intractability","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979). Computers and intractability, W.H. Freeman, San Francisco"},{"key":"8460_CR7","volume-title":"Algorithmic graph theory and perfect graphs","author":"MC Golumbic","year":"1980","unstructured":"Golumbic MC (1980) Algorithmic graph theory and perfect graphs. Academic Press, New York"},{"key":"8460_CR8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/jgt.3190070116","volume":"7","author":"A Gy\u00e1rf\u00e1s","year":"1983","unstructured":"Gy\u00e1rf\u00e1s A (1983) Vertex coverings by monochromatic paths and cycles. J Graph Theory 7:131\u2013135","journal-title":"J Graph Theory"},{"key":"8460_CR9","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1006\/jctb.1997.1737","volume":"69","author":"PE Haxell","year":"1997","unstructured":"Haxell PE (1997) Partitioning complete bipartite graphs by monochromatic cycles. J Combin Theory Ser B 69:210\u2013218","journal-title":"J Combin Theory Ser B"},{"key":"8460_CR10","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1006\/jctb.1996.0065","volume":"68","author":"PE Haxell","year":"1996","unstructured":"Haxell PE, Kohayakawa Y (1996) Partitioning by monochromatic trees. J Combin Theory Ser B 68:218\u2013222","journal-title":"J Combin Theory Ser B"},{"key":"8460_CR11","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/0210054","volume":"10","author":"L Holyer","year":"1981","unstructured":"Holyer L (1981) The NP-completeness of some edge-partition problems. SIAM J Comput 10:713\u2013717","journal-title":"SIAM J Comput"},{"issue":"11","key":"8460_CR12","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1080\/00207160412331290685","volume":"81","author":"Z Jin","year":"2004a","unstructured":"Jin Z, Li X (2004a) The complexity for partitioning graphs by monochromatic trees, cycles and paths. International J Computer Math 81(11):1357\u20131362","journal-title":"International J Computer Math"},{"key":"8460_CR13","unstructured":"Jin Z, Li X (2004b) Vertex partitions of r-edge-colored graphs. Submitted"},{"issue":"2","key":"8460_CR14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1002\/jgt.20044","volume":"48","author":"A Kaneko","year":"2005","unstructured":"Kaneko A, Kano M, Suzuki K (2005) Partitioning complete multipartite graphs by monochromatic trees. J Graph Theory 48(2):133\u2013141","journal-title":"J Graph Theory"},{"key":"8460_CR15","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0166-218X(98)00124-3","volume":"91","author":"G MacGillivray","year":"1999","unstructured":"MacGillivray G, Yu ML (1999) Generalized partitions of graphs. Disc Appl Math 91:143\u2013153","journal-title":"Disc Appl Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-8460-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-006-8460-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-8460-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:10Z","timestamp":1559276290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-006-8460-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,17]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["8460"],"URL":"https:\/\/doi.org\/10.1007\/s10878-006-8460-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,5,17]]}}}