{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T03:58:31Z","timestamp":1768535911397,"version":"3.49.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3400,"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":[[2004,5]]},"DOI":"10.1016\/s0166-218x(03)00371-8","type":"journal-article","created":{"date-parts":[[2003,10,31]],"date-time":"2003-10-31T23:43:26Z","timestamp":1067643806000},"page":"185-194","source":"Crossref","is-referenced-by-count":51,"title":["Partitioning chordal graphs into independent sets and cliques"],"prefix":"10.1016","volume":"141","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":"Loana Tito","family":"Nogueira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F\u00e1bio","family":"Protti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(03)00371-8_BIB1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1006\/jctb.1999.1913","article-title":"Extending graph colorings","volume":"77","author":"Albertson","year":"1999","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0166-218X(03)00371-8_BIB2","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 Math."},{"key":"10.1016\/S0166-218X(03)00371-8_BIB3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0012-365X(98)00014-4","article-title":"Corrigendum: Partitions of graphs into one or two independent sets and cliques","volume":"186","author":"Brandst\u00e4dt","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00371-8_BIB4","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 Appl. Math."},{"key":"10.1016\/S0166-218X(03)00371-8_BIB5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0012-365X(95)00277-4","article-title":"r-dominating cliques in graphs with hypertree structure","volume":"162","author":"Dragan","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00371-8_BIB6","series-title":"Proceedings of the 31st Annual ACM Symposium on Theory of Computing-STOC\u201999","first-page":"464","article-title":"Complexity of graph partition problems","author":"Feder","year":"1999"},{"key":"10.1016\/S0166-218X(03)00371-8_BIB7","first-page":"311","article-title":"Split graphs","volume":"19","author":"Foldes","year":"1977","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(03)00371-8_BIB8","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(03)00371-8_BIB9","doi-asserted-by":"crossref","unstructured":"P. Hell, S. Klein, L.T. Nogueira, F. Protti, On generalized split graphs, GRACO\u20192001, Electronic Notes in Discrete Mathematics, Vol. 7, Elsevier, Amsterdam, 2001.","DOI":"10.1016\/S1571-0653(04)00234-3"},{"key":"10.1016\/S0166-218X(03)00371-8_BIB10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/(SICI)1097-0118(199707)25:3<207::AID-JGT4>3.0.CO;2-P","article-title":"Coloring precolored perfect graphs","volume":"25","author":"Kratochv\u00edl","year":"1997","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(03)00371-8_BIB11","unstructured":"L.T. Nogueira, Grafos Split e Grafos Split Generalizados, Master Thesis, COPPE-Sistemas, Universidade Federal do Rio de Janeiro, Brazil, 1999 (in Portuguese)."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003718?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003718?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,26]],"date-time":"2020-03-26T12:26:01Z","timestamp":1585225561000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03003718"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["S0166218X03003718"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00371-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}