{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T10:04:45Z","timestamp":1698055485528},"reference-count":8,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6427,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1989,3]]},"abstract":"Abstract<\/jats:title>In this article we discuss the current results on the list chromatic conjecture and prove that if G<\/jats:italic> is a triangle free graph with maximum degree \u0394 then \u03c7apos;|<\/jats:sub>(G) \u2a7d; 9\u0394\/5.<\/jats:p>","DOI":"10.1002\/jgt.3190130112","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T12:17:02Z","timestamp":1180181822000},"page":"87-95","source":"Crossref","is-referenced-by-count":21,"title":["A note on list\u2010colorings"],"prefix":"10.1002","volume":"13","author":[{"given":"Amanda","family":"Chetwynd","sequence":"first","affiliation":[]},{"given":"Roland","family":"H\u00e4ggkvist","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"M.Behzad The total chromatic number of a graph: a survey Combinatorial Mathematics and Its Applications Proceedings of the Conference in Oxford 1969 Academic Press New York (1971)1\u20139."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02582936"},{"key":"e_1_2_1_4_2","first-page":"19","article-title":"Some old and new problems in various branches of combinatorics","volume":"23","author":"Erd\u00f6s P.","year":"1979","journal-title":"Congressus Numerantum"},{"key":"e_1_2_1_5_2","first-page":"125","article-title":"Choosability in graphs","volume":"26","author":"Erd\u00f6s P.","year":"1979","journal-title":"Congressus Numerantum"},{"key":"e_1_2_1_6_2","unstructured":"R.H\u00e4ggkvist Restricted edge\u2010colorings of bipartite graphs manuscript."},{"key":"e_1_2_1_7_2","unstructured":"A. J.Harris doctoral thesis."},{"key":"e_1_2_1_8_2","unstructured":"H.Hind An upper bound for the total chromatic number manuscript."},{"key":"e_1_2_1_9_2","unstructured":"V. G.Vizing Coloring the vertices of a graph in prescribed colors (Russian) Diskret. Analiz No 29 Metody Diskret. Anal. v Teorii Kodov i Shem(1976)3\u201310 101(MR58#16371)."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190130112","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190130112","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T16:52:41Z","timestamp":1697907161000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190130112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["10.1002\/jgt.3190130112"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190130112","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}