{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T05:21:11Z","timestamp":1768713671279,"version":"3.49.0"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5982,"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":[[1997,3]]},"DOI":"10.1016\/s0012-365x(97)84217-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"21-30","source":"Crossref","is-referenced-by-count":38,"special_numbering":"C","title":["The complexity of G-free colourability"],"prefix":"10.1016","volume":"165-166","author":[{"given":"Demetrios","family":"Achlioptas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)84217-3_BIB1","doi-asserted-by":"crossref","unstructured":"D. Achlioptas, J.I. Brown, D.G. Corneil and M.S.O. Molloy, The existence of uniquely \u2212G colourable graphs, Discrete Math., to appear.","DOI":"10.1016\/S0012-365X(97)00022-8"},{"key":"10.1016\/S0012-365X(97)84217-3_BIB2","article-title":"A Theory of Generalized Graph Colouring","author":"Brown","year":"1987"},{"key":"10.1016\/S0012-365X(97)84217-3_BIB3","unstructured":"J.I. Brown, The complexity of generalized graph coloring problems, submitted."},{"key":"10.1016\/S0012-365X(97)84217-3_BIB4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/jgt.3190110113","article-title":"On generalized graph colorings","volume":"11","author":"Brown","year":"1987","journal-title":"Graph Theory"},{"key":"10.1016\/S0012-365X(97)84217-3_BIB5","first-page":"141","article-title":"Perfect colourings","volume":"30","author":"Brown","year":"1990","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(97)84217-3_BIB6","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1080\/16073606.1992.9631706","article-title":"On uniquely \u2212G k-colourable graphs","volume":"15","author":"Brown","year":"1992","journal-title":"Quaestiones Math."},{"key":"10.1016\/S0012-365X(97)84217-3_BIB7","doi-asserted-by":"crossref","unstructured":"S. Burr, Private communication with authors of [11], 1976.","DOI":"10.2307\/2800391"},{"key":"10.1016\/S0012-365X(97)84217-3_BIB8","first-page":"167","article-title":"On graphs of Ramsey type","volume":"1","author":"Burr","year":"1976","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(97)84217-3_BIB9","first-page":"265","article-title":"A generalization of the chromatic number","volume":"64","author":"Chartrand","year":"1968"},{"key":"10.1016\/S0012-365X(97)84217-3_BIB10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02760181","article-title":"The point-arboricity of a graph","volume":"6","author":"Chartrand","year":"1968","journal-title":"Israel J. Math."},{"key":"10.1016\/S0012-365X(97)84217-3_BIB11","series-title":"Computers and Intractability; A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0012-365X(97)84217-3_BIB12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1002\/jgt.3190070111","article-title":"Graphs with unique Ramsey colorings","volume":"7","author":"Grossman","year":"1983","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)84217-3_BIB13","series-title":"Proc. Col. Symp. Graph Theory","first-page":"127","article-title":"Conditional colorability of graphs","author":"Harary","year":"1985"},{"key":"10.1016\/S0012-365X(97)84217-3_BIB14","first-page":"85","article-title":"Partitions of vertices","volume":"17","author":"N\u011bs\u011btril","year":"1976","journal-title":"Comm. Math. Univ. Carolinae"},{"key":"10.1016\/S0012-365X(97)84217-3_BIB15","series-title":"Recent Progress in Combinatorics","article-title":"Finite Graphs (Investigations and Generalizations concerning the construction of finite graphs having given chromatic number and no triangle)","author":"Sachs","year":"1968"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97842173?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97842173?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:27:29Z","timestamp":1556130449000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97842173"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":15,"alternative-id":["S0012365X97842173"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)84217-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}