{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T20:45:39Z","timestamp":1770324339677,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"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":6286,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1016\/0012-365x(94)00296-u","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T11:13:42Z","timestamp":1027595622000},"page":"47-54","source":"Crossref","is-referenced-by-count":64,"title":["Partitions of graphs into one or two independent sets and cliques"],"prefix":"10.1016","volume":"152","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00296-U_bib1","first-page":"19","article-title":"Partitions of graphs into one or two independent sets and cliques","author":"Brandst\u00e4dt","year":"1984"},{"key":"10.1016\/0012-365X(94)00296-U_bib2","series-title":"Proc. 8th Southeastern Conf. on Combinatorics, Graph Theory and Comput.","first-page":"311","article-title":"Split graphs","author":"F\u00f6ldes","year":"1977"},{"key":"10.1016\/0012-365X(94)00296-U_bib3","series-title":"A Guide to the Theory of NP-completeness","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(94)00296-U_bib4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0012-365X(94)00296-U_bib5","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0012-365X(94)00296-U_bib6","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF02579333","article-title":"The splittance of a graph","volume":"1","author":"Hammer","year":"1981","journal-title":"Combinatorica"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400296U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400296U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T07:30:14Z","timestamp":1556350214000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400296U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0012365X9400296U"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00296-u","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}