{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:31Z","timestamp":1720640791003},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"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":[[2002,7]]},"DOI":"10.1016\/s1571-0653(04)00115-5","type":"journal-article","created":{"date-parts":[[2004,10,15]],"date-time":"2004-10-15T11:21:27Z","timestamp":1097839287000},"page":"705-721","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Partitions of Graphs into Cographs"],"prefix":"10.1016","volume":"11","author":[{"given":"John","family":"Gimbel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaroslav","family":"Nes\u0306etr\u0306il","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0012-365X(97)84217-3","article-title":"The complexity of G-free colourability","volume":"165","author":"Achlioptas","year":"1997","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(89)90196-9","article-title":"The subchromatic number of a graph. Graph colouring and variations","volume":"74","author":"Albertson","year":"1989","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB3","series-title":"Graph theory with applications to algorithms and computer science (Alavi, et. al.)","first-page":"151","article-title":"Generalized colorings of outerplanar and planar graphs","author":"Broere","year":"1985"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB4","series-title":"Graph theory with applications to algorithms and computer science (Alavi, et. al.)","first-page":"583","article-title":"Generalized colorings of graphs","author":"Broere","year":"1985"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB5","series-title":"Graphs & Digraphs","author":"Chartrand","year":"1996"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB6","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB7","first-page":"26","article-title":"Clustering and domination in perfect graphs","volume":"6","author":"Corneil","year":"1984","journal-title":"Discrete Appl. Math"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB8","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Corneil","year":"1985","journal-title":"SIAM J. Compt"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/(SICI)1097-0118(199703)24:3<205::AID-JGT2>3.0.CO;2-T","article-title":"Defective coloring revisited","volume":"24","author":"Cowen","year":"1997","journal-title":"J. Graph Theory"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB10","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/jgt.3190100207","article-title":"Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency","volume":"10","author":"Cowen","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB11","first-page":"235","article-title":"The partite-chromatic number of a graph","volume":"53","author":"Domke","year":"1986","journal-title":"Congr. Numer"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB12","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1002\/jgt.3190150604","article-title":"Some extremal problems in cochromatic and dichromatic theory","volume":"15","author":"Erdos","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB13","series-title":"Graph theory, combinatorics and applications","first-page":"435","article-title":"A Note on the maximal order of an H-free subgraph in a random graph","author":"Erdos","year":"1991"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB14","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theor. Comput. Sci"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB15","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0166-218X(92)00121-2","article-title":"On cocolourings and cochromatic numbers of graphs","volume":"48","author":"Gimbel","year":"1994","journal-title":"Discrete Appl. Math"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB16","doi-asserted-by":"crossref","first-page":"4555","DOI":"10.1090\/S0002-9947-97-01926-0","article-title":"Coloring graphs with bounded genus and girth","volume":"349","author":"Gimbel","year":"1997","journal-title":"Trans. Am. Math. Soc"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB17","series-title":"Graph Coloring Problems","author":"Jensen","year":"1995"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB18","unstructured":"A. Kostochka and J. Nes\u0306etr\u0306il, Properties of the Descartes' construction of triangle-free graphs with high chromatic number, KAM-DIMATIA series 98\u2013380 (to appear in J. Graph Th.)."},{"issue":"no. 1","key":"10.1016\/S1571-0653(04)00115-5_NEWBIB19","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01195327","article-title":"Gadget classification","volume":"9","author":"Loebl","year":"1993","journal-title":"Graphs Combin"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB20","first-page":"237","article-title":"On decomposition of graphs","volume":"1","author":"Lovasz","year":"1966","journal-title":"Studia Sci. Math. Hungar"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB21","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01894680","article-title":"On chromatic number of finite set systems","volume":"19","author":"Lovasz","year":"1968","journal-title":"Acta Math. Acad. Sci. Hungar"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB22","series-title":"Invitation to Discrete Mathematics","author":"Matous\u0306ek","year":"1998"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB23","series-title":"Graph Theory","author":"Nes\u0306etr\u0306il","year":"1979"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB24","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/S0012-365X(96)00198-7","article-title":"Colorings and girth of oriented planar graphs","volume":"165\/166","author":"Nes\u0306etr\u0306il","year":"1997","journal-title":"Discrete Math"},{"issue":"no. 2","key":"10.1016\/S1571-0653(04)00115-5_NEWBIB25","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0095-8956(79)90084-4","article-title":"A short proof of the existence of highly chromatic hypergraphs without short cycles","volume":"27","author":"Nes\u0306etr\u0306il","year":"1979","journal-title":"J. Combin. Theory Ser B"},{"issue":"no. 2","key":"10.1016\/S1571-0653(04)00115-5_NEWBIB26","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0095-8956(89)90039-7","article-title":"Chromatically optimal rigid graphs","volume":"46","author":"Nes\u0306etr\u0306il","year":"1989","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB27","first-page":"229","article-title":"Density Contemporary trends in discrete mathematics","author":"Nes\u0306etr\u0306il","year":"1999","journal-title":"AMS"},{"key":"10.1016\/S1571-0653(04)00115-5_NEWBIB28","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0095-8956(74)90063-X","article-title":"On a property of the class of n-colorable graphs","volume":"16","author":"Seinsche","year":"1974","journal-title":"J. Comb. Th. Ser. B"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304001155?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304001155?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T21:54:18Z","timestamp":1549144458000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304001155"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":28,"alternative-id":["S1571065304001155"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00115-5","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}