{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:38:18Z","timestamp":1725557898561},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131813"},{"type":"electronic","value":"9783642131820"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13182-0_15","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T14:55:17Z","timestamp":1276354517000},"page":"156-168","source":"Crossref","is-referenced-by-count":0,"title":["Time Optimal d-List Colouring of a Graph"],"prefix":"10.1007","author":[{"given":"Nick","family":"Gravin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Elsevier, New York (1976)"},{"key":"15_CR2","unstructured":"Borodin, O.V.: A chromatic criteria for degree assignment. In: IV USSR conference on the theoretical cybernetics problems, in Novosibirsk, proceeding reports, pp. 127\u2013128 (1977) (in Russian)"},{"key":"15_CR3","unstructured":"Borodin, O.V.: Problems of colouring and of covering the vertex set of a graph by induced subgraphs, Ph.D. Thesis, Novosibirsk State University, Novosibirsk (1979) (in Russian)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0095-8956(77)90037-5","volume":"23","author":"O.V. Borodin","year":"1977","unstructured":"Borodin, O.V., Kostochka, A.V.: On an upper bound on a graph\u2019s chromatic number, depending on the graphs\u2019s degree and density. J. Comb. Th. (B)\u00a023, 247\u2013250 (1977)","journal-title":"J. Comb. Th. (B)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"R.L. Brooks","year":"1941","unstructured":"Brooks, R.L.: On colouring the nodes of network. Proc. Cambridge Phil. Soc.\u00a037, 194\u2013197 (1941)","journal-title":"Proc. Cambridge Phil. Soc."},{"key":"15_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/b100033","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory. Springer, Heidelberg (2000)"},{"key":"15_CR7","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. In: Proc. West-Coast Conf. on Combinatorics, Graph Theory and Computing, Arcata, California, Congr. Numer., vol.\u00a0XXVI, pp. 125\u2013157 (1979)"},{"key":"15_CR8","first-page":"373","volume":"8","author":"T. Gallai","year":"1963","unstructured":"Gallai, T.: Kritische Graphen I. Publ. Math. Inst. Hung. Acad. Sci.\u00a08, 373\u2013395 (1963)","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"15_CR9","volume-title":"Graph Colouring Problems","author":"T.R. Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph Colouring Problems. John Wiley & Sons, New York (1995)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, Ken-ichi, Mohar, B.: List-color-critical graphs on a fixed surface. In: SODA \u201909: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, New York, pp. 1156\u20131165 (2009)","DOI":"10.1137\/1.9781611973068.125"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Kostochka, A., Stiebitz, M.: A list version of Dirac\u2019s Theorem. J. Graph Th.\u00a039 (2002)","DOI":"10.1002\/jgt.998"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0012-365X(95)00294-7","volume":"162","author":"A. Kostochka","year":"1996","unstructured":"Kostochka, A., Stiebitz, M., Wirth, B.: The colour theorems of Brooks and Gallai extended. Discrete Math\u00a0162, 299\u2013303 (1996)","journal-title":"Discrete Math"},{"key":"15_CR13","series-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1090\/dimacs\/049\/13","volume-title":"New trends in the theory of graph colorings: choosability and list coloring","author":"J. Kratochv\u00edl","year":"1999","unstructured":"Kratochv\u00edl, J., Tuza, Z., Voigt, M.: New trends in the theory of graph colorings: choosability and list coloring. DIMACS Ser. Discrete Math. Theoret. Comput. Sci, vol.\u00a049, pp. 183\u2013197. Amer. Math. Soc., Providence (1999)"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0095-8956(75)90089-1","volume":"19","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: Three short proofs in graph theory. J. Comb. Th. (B)\u00a019, 269\u2013271 (1975)","journal-title":"J. Comb. Th.(B)"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1006\/jctb.1998.1891","volume":"76","author":"B. Reed","year":"1999","unstructured":"Reed, B.: A strengthening of Brooks\u2019 theorem. J. Comb. Th. (B)\u00a076, 136\u2013149 (1999)","journal-title":"J. Comb. Th. (B)"},{"issue":"3","key":"15_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ipl.2005.12.007","volume":"98","author":"S. Skulrattanakulchai","year":"2006","unstructured":"Skulrattanakulchai, S.: \u0394-List Vertex Coloring in Linear Time and Space. Information Processing Letters\u00a098(3), 101\u2013106 (2006)","journal-title":"Information Processing Letters"},{"issue":"2","key":"15_CR17","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput.\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"15_CR18","doi-asserted-by":"crossref","first-page":"161","DOI":"10.7151\/dmgt.1049","volume":"17","author":"Z. Tuza","year":"1997","unstructured":"Tuza, Z.: Graph colorings with local constraints\u2014a survey. Discussiones Math. Graph Th.\u00a017(2), 161\u2013228 (1997)","journal-title":"Discussiones Math. Graph Th."},{"key":"15_CR19","first-page":"3","volume":"29","author":"V. Vizing","year":"1976","unstructured":"Vizing, V.: Colouring the vertices of a graph in prescribed colours. Metody Diskret. Anal. v Teorii Kodov i Schem\u00a029, 3\u201310 (1976) (in Russian)","journal-title":"Metody Diskret. Anal. v Teorii Kodov i Schem"},{"key":"15_CR20","unstructured":"http:\/\/www1.spms.ntu.edu.sg\/~ngravin\/code\/Dcols.tgz"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13182-0_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:18Z","timestamp":1606186938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13182-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131813","9783642131820"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13182-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}