{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T13:18:38Z","timestamp":1723468718394},"reference-count":30,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5676,"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":[[1998,1]]},"DOI":"10.1016\/s0012-365x(97)00022-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:25:26Z","timestamp":1049721926000},"page":"1-11","source":"Crossref","is-referenced-by-count":5,"title":["The existence of uniquely \u2212G colourable graphs"],"prefix":"10.1016","volume":"179","author":[{"given":"D.","family":"Achlioptas","sequence":"first","affiliation":[]},{"given":"J.I.","family":"Brown","sequence":"additional","affiliation":[]},{"given":"D.G.","family":"Corneil","sequence":"additional","affiliation":[]},{"given":"M.S.O.","family":"Molloy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00022-8_BIB1","doi-asserted-by":"crossref","unstructured":"D. Achlioptas, The complexity of G-free colourability, Discrete. Math., to appear.","DOI":"10.1016\/S0012-365X(97)84217-3"},{"key":"10.1016\/S0012-365X(97)00022-8_BIB2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(89)90196-9","article-title":"The subchromatic number of a graph","volume":"74","author":"Albertson","year":"1989","journal-title":"Discrete. Math."},{"key":"10.1016\/S0012-365X(97)00022-8_BIB3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1080\/16073606.1990.9631616","article-title":"A construction of uniquely C4-free colourable graphs","volume":"13","author":"Benad\u00e9","year":"1990","journal-title":"Quaestiones Math."},{"key":"10.1016\/S0012-365X(97)00022-8_BIB4","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1979"},{"key":"10.1016\/S0012-365X(97)00022-8_BIB5","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/S0012-365X(97)00022-8_BIB6","doi-asserted-by":"crossref","first-page":"1340","DOI":"10.4153\/CJM-1976-133-5","article-title":"Uniquely colourable graphs with large girth","volume":"28","author":"Bollob\u00e1s","year":"1970","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0012-365X(97)00022-8_BIB7","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1112\/jlms\/s2-16.3.403","article-title":"Uniquely partitionable graphs","volume":"16","author":"Bollob\u00e1s","year":"1977","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0012-365X(97)00022-8_BIB8","series-title":"Graphs, Hypergraphs and Applications","first-page":"15","article-title":"On (n,P)-partitionable graphs","author":"Borowiecki","year":"1985"},{"key":"10.1016\/S0012-365X(97)00022-8_BIB9","series-title":"Graph Theory with Applications to Algorithms and Computer Science","first-page":"151","article-title":"Generalized colorings of outerplanar and planar graphs","author":"Broere","year":"1985"},{"key":"10.1016\/S0012-365X(97)00022-8_BIB10","article-title":"A theory of generalized graph colourings","author":"Brown","year":"1987"},{"key":"10.1016\/S0012-365X(97)00022-8_BIB11","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0166-218X(96)00096-0","article-title":"The complexity of generalized graph coloring problems","volume":"69","author":"Brown","year":"1996","journal-title":"Discrete. Appl. Math."},{"key":"10.1016\/S0012-365X(97)00022-8_BIB12","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":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)00022-8_BIB13","first-page":"141","article-title":"Perfect colourings","volume":"30","author":"Brown","year":"1990","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(97)00022-8_BIB14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0012-365X(91)90034-Y","article-title":"Graph properties and hypergraph colourings","volume":"98","author":"Brown","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00022-8_BIB15","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)00022-8_BIB16","first-page":"265","article-title":"A new construction of k-Folkman graphs","volume":"29","author":"Brown","year":"1990","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(97)00022-8_BIB17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0095-8956(91)90089-3","article-title":"A Ramsey type problem concerning vertex colourings","volume":"52","author":"Brown","year":"1991","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0012-365X(97)00022-8_BIB18","first-page":"11","article-title":"Folkman numbers for graphs of small order","volume":"35","author":"Brown","year":"1993","journal-title":"Ars Combin. A"},{"key":"10.1016\/S0012-365X(97)00022-8_BIB19","doi-asserted-by":"crossref","first-page":"349","DOI":"10.4153\/CMB-1972-063-2","article-title":"Colour classes for r-graphs","volume":"15","author":"Cockayne","year":"1972","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/S0012-365X(97)00022-8_BIB20","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/0118004","article-title":"Graphs with monochromatic complete subgraphs in every edge coloring","volume":"18","author":"Folkman","year":"1970","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0012-365X(97)00022-8_BIB21","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1002\/jgt.3190070111","article-title":"Graphs with unique Ramsey colourings","volume":"7","author":"Grossman","year":"1983","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)00022-8_BIB22","series-title":"Graphs and Applications","first-page":"127","article-title":"Conditional colorability of graphs","author":"Harary","year":"1985"},{"key":"10.1016\/S0012-365X(97)00022-8_BIB23","doi-asserted-by":"crossref","first-page":"203","DOI":"10.4153\/CMB-1968-023-5","article-title":"On partitioning planar graphs","volume":"11","author":"Hedetniemi","year":"1968","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/S0012-365X(97)00022-8_BIB24","first-page":"55","article-title":"Coloring of universal graphs","volume":"63","author":"Komjath","year":"1986","journal-title":"Discrete. Math."},{"key":"10.1016\/S0012-365X(97)00022-8_BIB25","series-title":"Graph Theory with Applications to Algorithms and Computer Science","first-page":"583","article-title":"Generalized colourings of graphs","author":"Mynhardt","year":"1985"},{"key":"10.1016\/S0012-365X(97)00022-8_BIB26","first-page":"85","article-title":"Partitions of vertices","volume":"17","author":"Ne\u0161et\u0159il","year":"1976","journal-title":"Comm. Math. Univ. Carolinae"},{"key":"10.1016\/S0012-365X(97)00022-8_BIB27","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0095-8956(76)90015-0","article-title":"The Ramsey property for graphs with forbidden complete subgraphs","volume":"20","author":"Ne\u0161et\u0159il","year":"1976","journal-title":"J. Combin. Theory. B"},{"key":"10.1016\/S0012-365X(97)00022-8_BIB28","first-page":"565","article-title":"On Ramsey graphs without cycles of short odd length","volume":"20","author":"Ne\u0161et\u0159il","year":"1979","journal-title":"Comm. Math. Univ. Carolinae"},{"key":"10.1016\/S0012-365X(97)00022-8_BIB29","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0012-365X(89)90211-2","article-title":"Chromatic partitions of a graph","volume":"74","author":"Sampathkumar","year":"1989","journal-title":"Discrete. Math."},{"issue":"2","key":"10.1016\/S0012-365X(97)00022-8_BIB30","first-page":"8","article-title":"Open Problems","volume":"5","author":"West","year":"1995","journal-title":"SIAM Activity Group Discrete Math. Newsletter"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97000228?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97000228?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T21:27:32Z","timestamp":1555968452000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97000228"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":30,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0012365X97000228"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00022-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}