{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T21:00:02Z","timestamp":1648674002712},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":6010,"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,2]]},"DOI":"10.1016\/s0012-365x(96)00052-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"197-212","source":"Crossref","is-referenced-by-count":1,"title":["The smallest hard-to-color graph for the SL algorithm"],"prefix":"10.1016","volume":"164","author":[{"given":"Marek","family":"Kubale","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaroslaw","family":"Pakulski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konrad","family":"Piwakowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00052-0_BIB1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0166-218X(94)90090-6","article-title":"Hard-to-color graphs for connected sequential colorings","volume":"51","author":"Babel","year":"1994","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(96)00052-0_BIB2","first-page":"81","article-title":"Slightly hard-to-color graphs","volume":"78","author":"Hansen","year":"1990"},{"key":"10.1016\/S0012-365X(96)00052-0_BIB3","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(91)90313-Q","article-title":"The smallest hard-to-color graph","volume":"96","author":"Hansen","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00052-0_BIB4","series-title":"Proc. 5th Southeastern Conf. on Combinatorics, Graph Theory and Computing, Utilitas Mathematicae","first-page":"513","article-title":"Worst-case behavior of graph coloring algorithms","author":"Johnson","year":"1974"},{"key":"10.1016\/S0012-365X(96)00052-0_BIB5","series-title":"Proc. Int. Conf. Operations Research '94","first-page":"133","article-title":"A catalogue of the smallest hard-to-color graphs","author":"Kubale","year":"1994"},{"key":"10.1016\/S0012-365X(96)00052-0_BIB6","series-title":"Graph Theory and Computing","first-page":"109","article-title":"Graph coloring algorithms","author":"Matula","year":"1972"},{"key":"10.1016\/S0012-365X(96)00052-0_BIB7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","article-title":"On the coloring of graphs (in French)","volume":"3","author":"Mycielski","year":"1955","journal-title":"Coll. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000520?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000520?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:26:55Z","timestamp":1556116015000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96000520"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0012365X96000520"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00052-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}