{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:34Z","timestamp":1720640854801},"reference-count":7,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":[[2000,7]]},"DOI":"10.1016\/s1571-0653(05)80110-6","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T07:08:52Z","timestamp":1114931332000},"page":"3-6","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Critical graphs for clique-coloring"],"prefix":"10.1016","volume":"5","author":[{"given":"Meziane","family":"Aider","sequence":"first","affiliation":[]},{"given":"Sylvain","family":"Gravier","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80110-6_BIB1","author":"Bacs\u00f3","year":"1999","journal-title":"Coloring the maximal cliques of graphs, Manuscript"},{"key":"10.1016\/S1571-0653(05)80110-6_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\u00f6s","year":"1966","journal-title":"Acta Math. Acad. Sci. Hungar."},{"issue":"3-4","key":"10.1016\/S1571-0653(05)80110-6_BIB3","first-page":"413","article-title":"Problems from the world surrounding perfect graphs","volume":"XIX","author":"Gy\u00e1rf\u00e1s","year":"1987","journal-title":"Zastosowania Matematyki - Applicationes Mathematical"},{"key":"10.1016\/S1571-0653(05)80110-6_BIB4","author":"Ho\u00e4ng","year":"1999","journal-title":"Coloring the hypergraph of maximal cliques of a graph with no long path, Submitted"},{"key":"10.1016\/S1571-0653(05)80110-6_BIB5","author":"Ho\u00e0ng","year":"1998","journal-title":"On the divisibility of graphs, Lakehead University, Ontario, Technical report 98-10-1"},{"key":"10.1016\/S1571-0653(05)80110-6_BIB6","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 Mathematics"},{"key":"10.1016\/S1571-0653(05)80110-6_BIB7","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":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801106?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801106?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T07:28:27Z","timestamp":1550388507000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":7,"alternative-id":["S1571065305801106"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80110-6","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}