{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:05:09Z","timestamp":1759104309525,"version":"3.44.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0166-218x(00)00377-2","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:12:20Z","timestamp":1034593940000},"page":"295-300","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["On connected list colorings of graphs"],"prefix":"10.1016","volume":"114","author":[{"given":"V.G.","family":"Vizing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00377-2_BIB1","unstructured":"V.A. Emelichev, O.I. Mel'nikov, V.I. Sarvanov, R.I. Tyshkevich, Lectures on Graph Theory, Nauka, Moscow, 1990 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00377-2_BIB2","first-page":"125","article-title":"Choosability in graphs","volume":"26","author":"Erd\u00f6s","year":"1980","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(00)00377-2_BIB3","unstructured":"O.P. Stecenko, On a type of edge coloring of a graph with assigned colors, Diskret. Mat. 9(4) (1997) 92\u201393 (in Russian)."},{"issue":"2","key":"10.1016\/S0166-218X(00)00377-2_BIB4","doi-asserted-by":"crossref","first-page":"161","DOI":"10.7151\/dmgt.1049","article-title":"Graph colorings with local constraints \u2013 a survey","volume":"17","author":"Tuza","year":"1997","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/S0166-218X(00)00377-2_BIB5","unstructured":"V.G. Vizing, Vertex coloring of a graph with assigned colors, Metody Diskret. Analiz. (Novosibirsk) 29 (1976) 3\u201310 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00377-2_BIB6","unstructured":"A.A. Zykov, The Basics of Graph Theory, Nauka, Moscow, 1987 (in Russian)."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003772?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003772?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T11:57:01Z","timestamp":1759060621000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003772"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166218X00003772"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00377-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2001,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On connected list colorings of graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0166-218X(00)00377-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}