{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T05:09:49Z","timestamp":1778994589060,"version":"3.51.4"},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":4156,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0166-218x(01)00179-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:10:54Z","timestamp":1027588254000},"page":"65-79","source":"Crossref","is-referenced-by-count":16,"title":["Complexity of list coloring problems with a fixed total number of colors"],"prefix":"10.1016","volume":"117","author":[{"given":"Sylvain","family":"Gravier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Kobler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wieslaw","family":"Kubiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00179-2_BIB1","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":"Biro","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00179-2_BIB2","first-page":"1","article-title":"A tourist guide through treewidth","volume":"11","author":"Bodlaender","year":"1993","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0166-218X(01)00179-2_BIB3","series-title":"Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science","first-page":"29","article-title":"Treewidth: algorithmic techniques, results","volume":"Vol. 1295","author":"Bodlaender","year":"1997"},{"key":"10.1016\/S0166-218X(01)00179-2_BIB4","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/moor.8.2.170","article-title":"A fast algorithm for the decomposition of graphs and posets","volume":"8","author":"Buer","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00179-2_BIB5","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00179-2_BIB6","series-title":"Proceedings of the Colloquium on Trees in Algebra and Programming\u2014CAAP\u201994","first-page":"68","article-title":"A new linear algorithm for modular decomposition","volume":"Vol. 787","author":"Cournier","year":"1994"},{"key":"10.1016\/S0166-218X(01)00179-2_BIB7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01195324","article-title":"On the vertex packing problem","volume":"9","author":"De Simone","year":"1993","journal-title":"Graphs Combin."},{"key":"10.1016\/S0166-218X(01)00179-2_BIB8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0012-365X(98)00169-1","article-title":"On the complexity of a restricted list coloring problem","volume":"195","author":"Dror","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00179-2_BIB9","unstructured":"P. Erd\u0151s, A.L. Rubin, H. Taylor, Choosability in graphs, Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata, CA, Congr. Numer. XXVI (1979) 125\u2013157."},{"key":"10.1016\/S0166-218X(01)00179-2_BIB10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0012-365X(97)89167-4","article-title":"Arrays of distinct representatives\u2014a very simple NP-complete problem","volume":"171","author":"Fon-Der-Flaass","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00179-2_BIB11","series-title":"Computers and Intractability: a Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(01)00179-2_BIB12","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(01)00179-2_BIB13","unstructured":"S. Gravier, Coloration et produits de graphes, Thesis, Universit\u00e9 Joseph Fourier, Grenoble, France, 1996 (in French)."},{"key":"10.1016\/S0166-218X(01)00179-2_BIB14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0166-218X(79)90043-X","article-title":"On the X-join decomposition for undirected graphs","volume":"1","author":"Habib","year":"1979","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00179-2_BIB15","unstructured":"C. Ho\u00e0ng, Thesis, McGill University, Montr\u00e9al, Canada, 1985."},{"key":"10.1016\/S0166-218X(01)00179-2_BIB16","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0166-218X(96)00085-6","article-title":"Generalized coloring for tree-like graphs","volume":"75","author":"Jansen","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00179-2_BIB17","unstructured":"D. Kobler, Mod\u00e8les biologique en optimisation combinatoire et mod\u00e8les math\u00e9matiques en g\u00e9n\u00e9tique, Thesis, Swiss Federal Institute of Technology in Lausanne, Switzerland, 1999 (in French)."},{"key":"10.1016\/S0166-218X(01)00179-2_BIB18","first-page":"139","article-title":"Precoloring extension with fixed color bound","volume":"62","author":"Kratochv'il","year":"1993","journal-title":"Acta Math. Univ. Comenian"},{"key":"10.1016\/S0166-218X(01)00179-2_BIB19","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","article-title":"Normal hypergraphs and the perfect graph conjecture","volume":"2","author":"Lov\u00e0sz","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00179-2_BIB20","unstructured":"R.M. McConnell, J. Spinrad, Linear-time modular decomposition and efficient transitive orientation of undirected graphs. Proceedings of the fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 536\u2013545."},{"key":"10.1016\/S0166-218X(01)00179-2_BIB21","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0095-8956(74)90063-X","article-title":"On a property of the class of n-colorable graphs","volume":"16","author":"Seinsche","year":"1974","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0166-218X(01)00179-2_BIB22","unstructured":"V.G. Vizing, Vertex colorings with given colors, Metody Diskret. Analiz. 29 (1976) 3\u201310 (in Russian)."},{"key":"10.1016\/S0166-218X(01)00179-2_BIB23","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0012-365X(96)00208-7","article-title":"Restricted coloring models for timetabling","volume":"165\/166","author":"de Werra","year":"1997","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01001792?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01001792?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T12:24:26Z","timestamp":1556972666000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01001792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0166218X01001792"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00179-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}