{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T05:11:01Z","timestamp":1712380261306},"reference-count":19,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"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":5433,"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":[[1998,9]]},"DOI":"10.1016\/s0012-365x(98)00101-0","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:18:15Z","timestamp":1049501895000},"page":"139-148","source":"Crossref","is-referenced-by-count":3,"title":["Complexity of choosing subsets from color sets"],"prefix":"10.1016","volume":"191","author":[{"given":"J.","family":"Kratochv\u00edl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zs.","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Voigt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00101-0_BIB1","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0012-365X(96)00159-8","article-title":"Choosability and fractional chromatic number","volume":"165\u2013166","author":"Alon","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00101-0_BIB2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0012-365X(92)90646-W","article-title":"Precoloring extension. I. Interval graphs","volume":"100","author":"Bir\u00f3","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00101-0_BIB3","series-title":"Graphentheorie","author":"Diestel","year":"1996"},{"key":"10.1016\/S0012-365X(98)00101-0_BIB4","series-title":"Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing","first-page":"125","article-title":"Choosability in graphs","author":"Erdo&#x030B;s","year":"1979"},{"key":"10.1016\/S0012-365X(98)00101-0_BIB5","series-title":"Surveys in Combinatorics, Proc. 13th British Combin. Conf.","first-page":"253","article-title":"Tur\u00e1n type problems","volume":"166","author":"F\u00fcredi","year":"1991"},{"key":"10.1016\/S0012-365X(98)00101-0_BIB6","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0012-365X(98)00101-0_BIB7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0012-365X(95)00104-5","article-title":"The complexity of planar graph choosability","volume":"159","author":"Gutner","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00101-0_BIB8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1017\/S0963548300001826","article-title":"Precoloring extension. III. Classes of perfect graphs","volume":"5","author":"Hujter","year":"1996","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/S0012-365X(98)00101-0_BIB9","series-title":"Proc. 18th Internat. Workshop on Graph-theoretic Concepts in Computer Science (WG'92)","first-page":"50","article-title":"Generalized colorings for tree-like graphs","volume":"vol. 652","author":"Jansen","year":"1993"},{"key":"10.1016\/S0012-365X(98)00101-0_BIB10","article-title":"Graph Coloring Problems","author":"Jensen","year":"1995"},{"key":"10.1016\/S0012-365X(98)00101-0_BIB11","unstructured":"J. Kratochvil, A. Sebo&#x030B;, Coloring precolored perfect graphs, J. Graph Theory, to appear."},{"key":"10.1016\/S0012-365X(98)00101-0_BIB12","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0166-218X(94)90150-3","article-title":"Algorithmic complexity of list colorings","volume":"50","author":"Kratochv\u00edl","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(98)00101-0_BIB13","series-title":"Proc. 6th Quadrennial Internat. Conf. on the Theory and Applications of Graphs","first-page":"1031","article-title":"From garbage to rainbows: generalizations of graph coloring and their applications","volume":"vol. 2","author":"Roberts","year":"1991"},{"key":"10.1016\/S0012-365X(98)00101-0_BIB14","series-title":"Quo Vadis, Graph Theory?","first-page":"13","article-title":"New directions in graph theory","volume":"55","author":"Roberts","year":"1993"},{"key":"10.1016\/S0012-365X(98)00101-0_BIB15","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01929486","article-title":"What we know and what we do not know about Tur\u00e1n numbers","volume":"11","author":"Sidorenko","year":"1995","journal-title":"Graphs and Combin."},{"key":"10.1016\/S0012-365X(98)00101-0_BIB16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.7151\/dmgt.1049","article-title":"Graph colorings with local constraints - A survey","volume":"17","author":"Tuza","year":"1997","journal-title":"Discussiones Mathematicae - Graph Theory"},{"key":"10.1016\/S0012-365X(98)00101-0_BIB17","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1002\/(SICI)1097-0118(199607)22:3<245::AID-JGT5>3.0.CO;2-M","article-title":"Every 2-choosable graph is (2m, m)-choosable","volume":"22","author":"Tuza","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00101-0_BIB18","first-page":"69","article-title":"On a conjecture of Erdo&#x030B;s, Rubin and Taylor","volume":"9","author":"Tuza","year":"1996","journal-title":"Tatra Mountains Math. Publications"},{"key":"10.1016\/S0012-365X(98)00101-0_BIB19","first-page":"3","article-title":"Coloring the vertices of a graph in prescribed colors","volume":"29","author":"Vizing","year":"1976","journal-title":"Metody Diskret. Anal. v Teorii Kodov i Shem"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001010?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001010?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:23:50Z","timestamp":1556666630000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98001010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0012365X98001010"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00101-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}