{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T21:14:36Z","timestamp":1649193276991},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"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":7899,"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":[[1991,12]]},"DOI":"10.1016\/0012-365x(91)90313-q","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"199-212","source":"Crossref","is-referenced-by-count":5,"title":["The smallest hard-to-color graph"],"prefix":"10.1016","volume":"96","author":[{"given":"Pierre","family":"Hansen","sequence":"first","affiliation":[]},{"given":"Julio","family":"Kuplinsky","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(91)90313-Q_BIB1","series-title":"Graphs","author":"Berge","year":"1985"},{"key":"10.1016\/0012-365X(91)90313-Q_BIB2","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1002\/jgt.3190110405","article-title":"Four classes of perfectly orderable graphs","volume":"11","author":"Chv\u00e1tal","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(91)90313-Q_BIB3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/321921.321926","article-title":"The complexity of near-optimal graph coloring","volume":"23","author":"Garey","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0012-365X(91)90313-Q_BIB4","first-page":"513","article-title":"Worst-case behavior of graph-coloring algorithms","author":"Johnson","year":"1974","journal-title":"Proc. 5th Southeast Conf. on Combinatorics, Graph Theory, and Computing"},{"key":"10.1016\/0012-365X(91)90313-Q_BIB5","series-title":"Graph Theory and Computing","article-title":"Graph coloring algorithms","author":"Matula","year":"1972"},{"key":"10.1016\/0012-365X(91)90313-Q_BIB6","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1093\/comjnl\/19.2.182","article-title":"On various algorithms for estimating the chromatic number of a graph","volume":"19","author":"Mitchem","year":"1976","journal-title":"Comput. J."},{"key":"10.1016\/0012-365X(91)90313-Q_BIB7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0012-365X(89)90212-4","article-title":"Sequential colorings versus Welsh-Powell bound","volume":"74","author":"Syslo","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(91)90313-Q_BIB8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","article-title":"An upper bound for the chromatic number of a graph and its application to timetabling problems","volume":"10","author":"Welsh","year":"1967","journal-title":"Comput. J."},{"key":"10.1016\/0012-365X(91)90313-Q_BIB9","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1145\/2157.2158","article-title":"Improving the performance guarantee for approximate graph coloring","volume":"30","author":"Wigderson","year":"1983","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190313Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190313Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:23:29Z","timestamp":1555136609000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9190313Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["0012365X9190313Q"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(91)90313-q","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}