{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T06:31:42Z","timestamp":1720247502229},"reference-count":19,"publisher":"Elsevier BV","issue":"21","license":[{"start":{"date-parts":[[2012,11,1]],"date-time":"2012-11-01T00:00:00Z","timestamp":1351728000000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1016\/j.ipl.2012.07.011","type":"journal-article","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T21:49:40Z","timestamp":1342820980000},"page":"829-834","source":"Crossref","is-referenced-by-count":6,"title":["Partitioning extended -laden graphs into cliques and stable sets"],"prefix":"10.1016","volume":"112","author":[{"given":"Raquel S.F.","family":"Bravo","sequence":"first","affiliation":[]},{"given":"Sulamita","family":"Klein","sequence":"additional","affiliation":[]},{"given":"Loana T.","family":"Nogueira","sequence":"additional","affiliation":[]},{"given":"F\u00e1bio","family":"Protti","sequence":"additional","affiliation":[]},{"given":"Rudini M.","family":"Sampaio","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2012.07.011_br0010_1","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":"Bransdst\u00e4dt","year":"1996","journal-title":"Discrete Mathematics"},{"issue":"1\u20133","key":"10.1016\/j.ipl.2012.07.011_br0010_2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0012-365X(98)00014-4","volume":"186","author":"Bransdst\u00e4dt","year":"1998","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.ipl.2012.07.011_br0020","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":"Bransdst\u00e4dt","year":"1998","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ipl.2012.07.011_br0030","series-title":"7th International Colloquium on Graph Theory, Hyeres, 2005","first-page":"277","article-title":"Characterizing (k,l)-partitionable cographs","volume":"vol. 22","author":"Bravo","year":"2005"},{"key":"10.1016\/j.ipl.2012.07.011_br0040","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.dam.2010.10.019","article-title":"Characterization and recognition of P4-sparse graphs partitionable into k independent sets and \u2113 cliques","volume":"159","author":"Bravo","year":"2011","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ipl.2012.07.011_br0050","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.disopt.2005.03.003","article-title":"Partitioning cographs into cliques and stable sets","volume":"2","author":"Demange","year":"2005","journal-title":"Discrete Optimization"},{"key":"10.1016\/j.ipl.2012.07.011_br0060","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10878-005-4103-7","article-title":"On split-coloring problems","volume":"10","author":"Ekim","year":"2005","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/j.ipl.2012.07.011_br0070","series-title":"Quo Vadis, Graph Theory?","first-page":"261","article-title":"Some problems and results in cochromatic theory","author":"Erd\u0151s","year":"1993"},{"key":"10.1016\/j.ipl.2012.07.011_br0080","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1002\/jgt.3190150604","article-title":"Some extremal results in cochromatic and dichromatic theory","volume":"15","author":"Erd\u0151s","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ipl.2012.07.011_br0090","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0195-6698(13)80123-0","article-title":"Chromatic number versus cochromatic number in graphs with bounded clique number","volume":"11","author":"Erd\u0151s","year":"1990","journal-title":"European J. Combin."},{"key":"10.1016\/j.ipl.2012.07.011_br0100","series-title":"Graph Theory in Paris, Proceedings of a Conference in Memory of Cloude Berge","first-page":"149","article-title":"Generalized colourings (matrix partitions) of cographs","author":"Feder","year":"2007"},{"key":"10.1016\/j.ipl.2012.07.011_br0110","doi-asserted-by":"crossref","first-page":"2450","DOI":"10.1016\/j.disc.2005.12.035","article-title":"Matrix partitions of perfect graphs","volume":"306","author":"Feder","year":"2006","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.ipl.2012.07.011_br0120","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0020-0190(96)00134-2","article-title":"P4-laden graphs: a new class of brittle graphs","volume":"60","author":"Giakoumakis","year":"1996","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.ipl.2012.07.011_br0130","unstructured":"J. Gimbel, The chromatic and cochromatic number of a graph, PhD thesis, Estern Michigan University, 1984."},{"key":"10.1016\/j.ipl.2012.07.011_br0140","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/978-3-642-13731-0_32","article-title":"Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing","volume":"6139","author":"Heggernes","year":"2010","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/j.ipl.2012.07.011_br0150","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0166-218X(03)00371-8","article-title":"Partitioning chordal graphs into independent sets and cliques","volume":"141","author":"Hell","year":"2004","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ipl.2012.07.011_br0160","first-page":"39","article-title":"The cochromatic number of a graph","volume":"3","author":"Lesniak","year":"1977","journal-title":"Ars Combinatoria"},{"key":"10.1016\/j.ipl.2012.07.011_br0170","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.dam.2010.10.002","article-title":"On the b-coloring of P4-tidy graphs","volume":"159","author":"Velasquez","year":"2011","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ipl.2012.07.011_br0180","first-page":"633","article-title":"Monotonic coverings of finite sets","volume":"20","author":"Wagner","year":"1984","journal-title":"Elektron. Inform. Kybernet."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019012001998?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019012001998?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T20:03:36Z","timestamp":1542830616000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019012001998"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11]]},"references-count":19,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["S0020019012001998"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2012.07.011","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2012,11]]}}}