{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T04:26:06Z","timestamp":1784694366299,"version":"3.55.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"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":3582,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1016\/s0012-365x(03)00197-3","type":"journal-article","created":{"date-parts":[[2003,10,15]],"date-time":"2003-10-15T19:18:58Z","timestamp":1066245538000},"page":"285-290","source":"Crossref","is-referenced-by-count":65,"title":["Coloring the hypergraph of maximal cliques of a graph with no long path"],"prefix":"10.1016","volume":"272","author":[{"given":"Sylvain","family":"Gravier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ch\u0131\u0301nh T.","family":"Ho\u00e0ng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Maffray","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00197-3_BIB1","unstructured":"G. Bacs\u00f3, S. Gravier, A. Gy\u00e1rf\u00e1s, M. Preissmann, A. Seb\u0151, Coloring the maximal cliques of graphs, Research Report 32, Laboratoire Leibniz, France, 2001 (http:\/\/www-leibniz.imag.fr\/LesCahiers\/2001\/Cahier32)."},{"key":"10.1016\/S0012-365X(03)00197-3_BIB2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02020444","article-title":"On the chromatic number of graphs and set systems","volume":"17","author":"Erd\u0151s","year":"1966","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/S0012-365X(03)00197-3_BIB3","doi-asserted-by":"crossref","unstructured":"A. Gy\u00e1rf\u00e1s, Problems from the world surrounding perfect graphs, Zastosowania Matematyki\u2014Applicationes Mathematicae XIX (3\u20134) (1987) 413\u2013441.","DOI":"10.4064\/am-19-3-4-413-441"},{"key":"10.1016\/S0012-365X(03)00197-3_BIB4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0012-365X(01)00054-1","article-title":"On the divisibility of graphs","volume":"242","author":"Ho\u00e0ng","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00197-3_BIB5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0012-365X(97)89267-9","article-title":"On the NP-completeness of the k-colorability problem for triangle-free graphs","volume":"162","author":"Maffray","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00197-3_BIB6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","article-title":"Sur le coloriage des graphes","volume":"3","author":"Mycielski","year":"1955","journal-title":"Colloq. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001973?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001973?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,19]],"date-time":"2019-02-19T17:58:04Z","timestamp":1550599084000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03001973"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":6,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S0012365X03001973"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00197-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}