{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:01Z","timestamp":1725664921652},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540625599"},{"type":"electronic","value":"9783540680727"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62559-3_7","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:41:25Z","timestamp":1330278085000},"page":"67-72","source":"Crossref","is-referenced-by-count":0,"title":["Clique and anticlique partitions of graphs"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Bry\u015b","sequence":"first","affiliation":[]},{"given":"Zbigniew","family":"Lonc","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01956769","volume":"42","author":"N. Alon","year":"1983","unstructured":"N. Alon: A note on the decomposition of graphs into isomorphic matchings, Acta Math. Acad. Sci. Hung. 42 (1983), 221\u2013223.","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0885-064X(91)90006-J","volume":"7","author":"E. Cohen","year":"1991","unstructured":"E. Cohen, M. Tarsi: NP-completeness of graph decomposition problem, Journal of Complexity 7 (1991), 200\u2013212.","journal-title":"Journal of Complexity"},{"key":"7_CR3","volume-title":"A guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability. A guide to the Theory of NP-Completeness, Freeman, San Francisco 1979."},{"key":"7_CR4","first-page":"125","volume":"20","author":"O. Favaron","year":"1985","unstructured":"O. Favaron, Z. Lonc, M. Truszczy\u0144ski: Decomposition of graphs into graphs with three edges, Ars Combinatoria 20 (1985), 125\u2013146.","journal-title":"Ars Combinatoria"},{"key":"7_CR5","unstructured":"Z. Lonc, Delta-system decompositions of graphs, to appear in Discrete Applied Mathematics."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Z. Lonc, On complexity of some chain and antichain partition problem, in Graph-Theoretic Concepts in Computer Science (ed. G. Schmidt and R. Berghammer), Lecture Notes in Computer Science 570, Springer-Verlag 1992, 97\u2013104.","DOI":"10.1007\/3-540-55121-2_9"},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00582740","volume":"1","author":"Z. Lonc","year":"1985","unstructured":"Z. Lonc and M. Truszczy\u0144ski, Decomposition of large uniform hypergraphs, Order 1 (1985) 345\u2013350.","journal-title":"Order"},{"key":"7_CR8","first-page":"583","volume-title":"Problem 9.10, in Graphs and Order","author":"R.H. M\u00f6hring","year":"1985","unstructured":"R.H. M\u00f6hring, Problem 9.10, in Graphs and Order (ed. I. Rival), Reidel Publishing Co., Dordrecht 1985, 583."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62559-3_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:13:14Z","timestamp":1605629594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62559-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540625599","9783540680727"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-62559-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}