{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T12:48:19Z","timestamp":1772714899494,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100003549","name":"Hungarian Scientific Research Fund","doi-asserted-by":"publisher","award":["GAC\u02c7 R 201\/99\/0242"],"award-info":[{"award-number":["GAC\u02c7 R 201\/99\/0242"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003549","name":"Hungarian Scientific Research Fund","doi-asserted-by":"publisher","award":["LN00A056"],"award-info":[{"award-number":["LN00A056"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003549","name":"Hungarian Scientific Research Fund","doi-asserted-by":"publisher","award":["OTKA T-026575"],"award-info":[{"award-number":["OTKA T-026575"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003549","name":"Hungarian Scientific Research Fund","doi-asserted-by":"publisher","award":["T-032969"],"award-info":[{"award-number":["T-032969"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0196-6774(02)00221-3","type":"journal-article","created":{"date-parts":[[2003,1,9]],"date-time":"2003-01-09T08:10:03Z","timestamp":1042099803000},"page":"40-54","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":48,"title":["On the complexity of bicoloring clique hypergraphs of graphs"],"prefix":"10.1016","volume":"45","author":[{"given":"Jan","family":"Kratochv\u0131&#x;l","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0196-6774(02)00221-3_BIB001","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0012-365X(98)00087-9","article-title":"On the clique-transversal number of chordal graphs","volume":"191","author":"Andreae","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S0196-6774(02)00221-3_BIB002","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0012-365X(94)00276-O","article-title":"On covering all cliques of a chordal graph","volume":"149","author":"Andreae","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0196-6774(02)00221-3_BIB003","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0012-365X(91)90055-7","article-title":"Clique-transversal sets of line graphs and complements of line graphs","volume":"88","author":"Andreae","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0196-6774(02)00221-3_BIB004","unstructured":"G. Bacs\u00f3, S. Gravier, A. Gy\u00e1rf\u00e1s, M. Preissmann, A. Sebő, Colouring the maximal cliques of graphs, Manuscript, 1998"},{"key":"10.1016\/S0196-6774(02)00221-3_BIB005","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0097-3165(91)90009-6","article-title":"Two-colouring all two-element maximal antichains","volume":"57","author":"Duffus","year":"1991","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0196-6774(02)00221-3_BIB006","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0012-365X(92)90681-5","article-title":"Covering the cliques of a graph with vertices","volume":"108","author":"Erdős","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0196-6774(02)00221-3_BIB007","series-title":"Infinite and Finite Sets","first-page":"609","article-title":"Problems and results on 3-chromatic hypergraphs and related questions","volume":"10","author":"Erdős","year":"1974"},{"key":"10.1016\/S0196-6774(02)00221-3_BIB008","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0196-6774(02)00221-3_BIB009","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0204019","article-title":"Finding a maximum cut of a planar graph in polynomial time","volume":"4","author":"Hadlock","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0196-6774(02)00221-3_BIB010","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","article-title":"On generating all maximal independent sets","volume":"27","author":"Johnson","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0196-6774(02)00221-3_BIB011","unstructured":"J. Kratochv\u0131́l, R. \u0160krekovski, Unpublished, February, 2000"},{"key":"10.1016\/S0196-6774(02)00221-3_BIB012","series-title":"Proceedings of 11th Annual ACM symposium on Discrete Algorithms, SODA'00, San Francisco, January 2000, ACM and SIAM","first-page":"40","article-title":"Bicoloring clique hypergraphs (extended abstract)","author":"Kratochv\u0131́l","year":"2000"},{"key":"10.1016\/S0196-6774(02)00221-3_BIB013","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","article-title":"Planar formulae and their uses","volume":"11","author":"Lichtenstein","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0196-6774(02)00221-3_BIB014","doi-asserted-by":"crossref","first-page":"#R26","DOI":"10.37236\/1458","article-title":"Gr\u00f6tzsch theorems for the hypergraph of maximal cliques","volume":"6","author":"Mohar","year":"1999","journal-title":"Electron. J. Combin."},{"key":"10.1016\/S0196-6774(02)00221-3_BIB015","first-page":"502","article-title":"Finding the maximal cut in a graph","volume":"10","author":"Orlova","year":"1972","journal-title":"Engrg. Cybernetics"},{"key":"10.1016\/S0196-6774(02)00221-3_BIB016","series-title":"Maximum Cuts and Large Bipartite Subgraphs","volume":"20","author":"Poljak","year":"1995"},{"key":"10.1016\/S0196-6774(02)00221-3_BIB017","series-title":"Proc. 10th Annual ACM Symposium on the Theory of Computing","first-page":"216","article-title":"The complexity of satisfiability problems","author":"Schaefer","year":"1978"},{"key":"10.1016\/S0196-6774(02)00221-3_BIB018","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0012-365X(90)90354-K","article-title":"Covering all cliques of a graph","volume":"86","author":"Tuza","year":"1990","journal-title":"Discrete Math."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677402002213?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677402002213?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T06:08:47Z","timestamp":1759298927000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677402002213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0196677402002213"],"URL":"https:\/\/doi.org\/10.1016\/s0196-6774(02)00221-3","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the complexity of bicoloring clique hypergraphs of graphs","name":"articletitle","label":"Article Title"},{"value":"Journal of Algorithms","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0196-6774(02)00221-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science (USA). All rights reserved.","name":"copyright","label":"Copyright"}]}}