{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:11Z","timestamp":1759638791964},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_38","type":"book-chapter","created":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T03:02:27Z","timestamp":1395716547000},"page":"433-441","source":"Crossref","is-referenced-by-count":1,"title":["Connected Greedy Colourings"],"prefix":"10.1007","author":[{"given":"Fabr\u00edcio","family":"Benevides","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Campos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitre","family":"Dourado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Griffiths","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Morris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonardo","family":"Sampaio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana","family":"Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","unstructured":"Beyer, T., Hedetniemi, S.M., Hedetniemi, S.T.: A linear algorithm for the grundy number of a tree. In: Proceedings of the Thirteenth Southeastern Conference on Combinatorics, Graph Theory and Computing. Utilitas Mathematica, pp. 351\u2013363 (1982)"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1145\/502949.502896","volume":"19","author":"F. Chow","year":"1984","unstructured":"Chow, F., Hennessy, J.: Register allocation by priority-based coloring. ACM SIGPLAN Notices\u00a019, 222\u2013232 (1984)","journal-title":"ACM SIGPLAN Notices"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/88616.88621","volume":"12","author":"F. Chow","year":"1990","unstructured":"Chow, F., Hennessy, J.: The priority-based coloring approach to register allocation. ACM Transactions on Programming Languages and Systems\u00a012, 501\u2013536 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"38_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0012-365X(80)90236-8","volume":"30","author":"D.P. Dailey","year":"1980","unstructured":"Dailey, D.P.: Uniqueness of colorability and colorability of planar 4-regular graphs are np-complete. Discrete Mathematics\u00a030(3), 289\u2013293 (1980)","journal-title":"Discrete Mathematics"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Gamst, A.: Some lower bounds for the class of frequency assignment problems. IEEE Transactions on Vehicular Technology\u00a035(8\u201314) (1986)","DOI":"10.1109\/T-VT.1986.24063"},{"issue":"4","key":"38_CR6","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s00453-011-9604-4","volume":"65","author":"F. Havet","year":"2013","unstructured":"Havet, F., Sampaio, L.: On the grundy and b-chromatic numbers of a graph. Algorithmica\u00a065(4), 885\u2013899 (2013)","journal-title":"Algorithmica"},{"issue":"4","key":"38_CR7","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM Journal on Computing\u00a010(4), 718\u2013720 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"38_CR8","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n\n                  1\u2009\u2212\u2009\u03b5\n                  . In: Acta Mathematica, pp. 627\u2013636 (1996)"},{"key":"38_CR9","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y. Saad","year":"1996","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems. PWS Publishing Company, Boston (1996)"},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1137\/S0895480194275825","volume":"10","author":"J.A. Telle","year":"1997","unstructured":"Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM Journal on Discrete Mathematics\u00a010, 529\u2013550 (1997)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D. Werra","year":"1985","unstructured":"Werra, D.: An introduction to timetabling. European Journal of Operations Research\u00a019, 151\u2013161 (1985)","journal-title":"European Journal of Operations Research"},{"key":"38_CR12","first-page":"325","volume":"31","author":"M. Zaker","year":"2005","unstructured":"Zaker, M.: The grundy chromatic number of the complement of bipartite graphs. Australasian Journal of Combinatorics\u00a031, 325\u2013329 (2005)","journal-title":"Australasian Journal of Combinatorics"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing 3(6) (2007)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T12:37:25Z","timestamp":1558874245000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}