{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:31:20Z","timestamp":1709829080135},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1983,1]]},"DOI":"10.1016\/0166-218x(83)90020-3","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"111-117","source":"Crossref","is-referenced-by-count":12,"title":["NP-completeness of a family of graph-colouring problems"],"prefix":"10.1016","volume":"5","author":[{"given":"Robert W.","family":"Irving","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(83)90020-3_BIB1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0012-365X(79)90148-1","article-title":"Set colourings of graphs","volume":"25","author":"Bollobas","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(83)90020-3_BIB2","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","article-title":"Intersection theorems for systems of finite sets","volume":"12","author":"Erd\u00f6s","year":"1961","journal-title":"Quart. J. Math. Oxford Ser."},{"key":"10.1016\/0166-218X(83)90020-3_BIB3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/321921.321926","article-title":"The complexity of near-optimal graph colouring","volume":"23","author":"Garey","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0166-218X(83)90020-3_BIB4","series-title":"Computers and Intractability \u2014 A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(83)90020-3_BIB5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(83)90020-3_BIB6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0012-365X(76)90089-3","article-title":"r-tuple colourings of uniquely colourable graphs","volume":"16","author":"Geller","year":"1976","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/0166-218X(83)90020-3_BIB7","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1093\/qmath\/18.1.369","article-title":"Some intersection theorems for systems of finite sets","volume":"18","author":"Hilton","year":"1967","journal-title":"Quart. J. Math. Oxford"},{"key":"10.1016\/0166-218X(83)90020-3_BIB8","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1112\/blms\/5.3.302","article-title":"A (<5)-colour theorem for planar graphs","volume":"5","author":"Hilton","year":"1973","journal-title":"Bull. London Math. Soc."},{"issue":"A","key":"10.1016\/0166-218X(83)90020-3_BIB9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0097-3165(78)90022-5","article-title":"Kneser's conjecture, chromatic number and homotopy","volume":"25","author":"Lov\u00e1sz","year":"1978","journal-title":"J. Combin. Theory"},{"issue":"B","key":"10.1016\/0166-218X(83)90020-3_BIB10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0095-8956(73)90016-6","article-title":"The footballers of Croam","volume":"15","author":"Meredith","year":"1973","journal-title":"J. Combin. Theory"},{"issue":"B","key":"10.1016\/0166-218X(83)90020-3_BIB11","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0095-8956(76)90010-1","article-title":"n-tuple colorings and associated graphs","volume":"20","author":"Stahl","year":"1976","journal-title":"J. Combin. Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X83900203?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X83900203?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T12:29:57Z","timestamp":1554812997000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X83900203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,1]]}},"alternative-id":["0166218X83900203"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(83)90020-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1983,1]]}}}