{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T15:42:58Z","timestamp":1775490178467,"version":"3.50.1"},"reference-count":4,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":3669,"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":[[2003,7]]},"DOI":"10.1016\/s0012-365x(03)00033-5","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T14:55:35Z","timestamp":1048604135000},"page":"303-308","source":"Crossref","is-referenced-by-count":8,"title":["On a list-coloring problem"],"prefix":"10.1016","volume":"268","author":[{"given":"Sylvain","family":"Gravier","sequence":"first","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Maffray","sequence":"additional","affiliation":[]},{"given":"Bojan","family":"Mohar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00033-5_BIB1","doi-asserted-by":"crossref","unstructured":"S. Dantas, S. Gravier, F. Maffray, Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum, Research Report 18, Laboratoire Leibniz-IMAG, Grenoble, 2000; Discrete Appl. Math. (special volume, Brazilian Symposium on Graphs, Algorithms and Combinatorics), to appear.","DOI":"10.1016\/S1571-0653(04)00215-X"},{"key":"10.1016\/S0012-365X(03)00033-5_BIB2","first-page":"125","article-title":"Choosability in graphs","volume":"26","author":"Erd\u0151s","year":"1979","journal-title":"Congr. Numer."},{"key":"10.1016\/S0012-365X(03)00033-5_BIB3","unstructured":"N.V.R. Mahadev, F.S. Roberts, P. Santhanakrishnan, 3-choosable complete bipartite graphs, RUTCOR Research Report 49-91, Rutgers University, NJ, USA, 1991."},{"key":"10.1016\/S0012-365X(03)00033-5_BIB4","first-page":"3","article-title":"Vertex colourings with given colors","volume":"29","author":"Vizing","year":"1976","journal-title":"Metody Diskret. Analiz."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03000335?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03000335?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:24:17Z","timestamp":1682468657000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03000335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":4,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0012365X03000335"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00033-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}