{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:54:52Z","timestamp":1742990092402,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174926"},{"type":"electronic","value":"9783642174933"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17493-3_17","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T13:41:01Z","timestamp":1291383661000},"page":"170-179","source":"Crossref","is-referenced-by-count":4,"title":["On the Grundy Number of a Graph"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Havet","sequence":"first","affiliation":[]},{"given":"Leonardo","family":"Sampaio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","first-page":"201","volume":"18","author":"A. Beutelspacher","year":"1984","unstructured":"Beutelspacher, A., Hering, P.-R.: Minimal graphs for which the chromatic number equals the maximal degree. Ars Combin.\u00a018, 201\u2013216 (1984)","journal-title":"Ars Combin."},{"issue":"2-3","key":"17_CR2","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 of a graph\u2019s chromatic number, depending on the graph\u2019s degree and density. J. Combinatorial Theory Ser. B\u00a023(2-3), 247\u2013250 (1977)","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"17_CR3","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 a network. Proc. Cambridge Phil. Soc.\u00a037, 194\u2013197 (1941)","journal-title":"Proc. Cambridge Phil. Soc."},{"key":"17_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity. Monographs in Computer Science","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science, 1st edn. Springer, New York (1999)","edition":"1"},{"issue":"4","key":"17_CR5","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1017\/S0963548398003678","volume":"7","author":"T. Emden-Weinert","year":"1998","unstructured":"Emden-Weinert, T., Hougardy, S., Kreuter, B.: Uniquely colourable graphs and the hardness of colouring graphs of large girth. Combin. Probab. Comput.\u00a07(4), 375\u2013386 (1998)","journal-title":"Combin. Probab. Comput."},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.jctb.2004.09.006","volume":"93","author":"B. Farzad","year":"2005","unstructured":"Farzad, B., Molloy, M., Reed, B.: (\u0394\u2212\u2009k)-critical graphs. J. Combinatorial Theory Ser. B\u00a093(2), 173\u2013185 (2005)","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theoret. Comput. Sci.\u00a01, 237\u2013267 (1976)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0902019","volume":"2","author":"I. Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Computing\u00a02, 225\u2013231 (1981)","journal-title":"SIAM J. Computing"},{"issue":"4","key":"17_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An O(n 5\/2) algorithm for maximum matchings in bipartite graphs. SIAM J. Comput.\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"17_CR10","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","volume-title":"Graph coloring problems","author":"T.R. Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph coloring problems. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, Inc., New-York (1995)"},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1145\/380752.380840","volume-title":"Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing","author":"M. Molloy","year":"2001","unstructured":"Molloy, M., Reed, B.: Colouring graphs when the number of colours is nearly the maximum degree. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 462\u2013470 (electronic). ACM, New York (2001)"},{"key":"17_CR12","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"2","key":"17_CR13","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. Combinatorial Theory Ser. B\u00a076(2), 136\u2013149 (1999)","journal-title":"J. Combinatorial Theory Ser. B"},{"issue":"23","key":"17_CR14","doi-asserted-by":"publisher","first-page":"3166","DOI":"10.1016\/j.disc.2005.06.044","volume":"306","author":"M. Zaker","year":"2006","unstructured":"Zaker, M.: Results on the Grundy chromatic number of graphs. Discrete Math.\u00a0306(23), 3166\u20133173 (2006)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17493-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,14]],"date-time":"2021-11-14T16:08:40Z","timestamp":1636906120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17493-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174926","9783642174933"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17493-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}