{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:45:38Z","timestamp":1720640738047},"reference-count":4,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s1571-0653(04)00234-3","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T09:34:04Z","timestamp":1113039244000},"page":"98-101","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["On generalized split graphs"],"prefix":"10.1016","volume":"7","author":[{"given":"Pavol","family":"Hell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sulamita","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Protti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loana","family":"Tito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00234-3_BIB1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(94)00296-U","article-title":"Partitions of graphs into one or two independent sets and cliques","volume":"152","author":"Brandst\u00e4dt","year":"1996","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S1571-0653(04)00234-3_BIB2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0166-218X(98)00116-4","article-title":"The complexity of some problems related to graph 3-colorability","volume":"89","author":"Brandst\u00e4dt","year":"1998","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S1571-0653(04)00234-3_BIB3","series-title":"Proceedings of the 31st Annual ACM Symposium on Theory of Computing - STOC'99","first-page":"464","article-title":"Complexity of graph partition problems","author":"Feder","year":"1999"},{"key":"10.1016\/S1571-0653(04)00234-3_BIB4","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304002343?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304002343?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T08:50:37Z","timestamp":1548579037000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304002343"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":4,"alternative-id":["S1571065304002343"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00234-3","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}