{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T02:38:39Z","timestamp":1783132719607,"version":"3.54.6"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T00:00:00Z","timestamp":1450656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10878-015-9981-8","type":"journal-article","created":{"date-parts":[[2015,12,20]],"date-time":"2015-12-20T19:59:37Z","timestamp":1450641577000},"page":"580-589","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["More bounds for the Grundy number of graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Zixing","family":"Tang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Baoyindureng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lin","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manoucheher","family":"Zaker","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,12,21]]},"reference":[{"key":"9981_CR1","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1016\/j.dam.2011.12.018","volume":"161","author":"M Aouchiche","year":"2013","unstructured":"Aouchiche M, Hansen P (2013) A survey of Nordhaus-Gaddum type relations. Discrete Appl Math 161:466\u2013546","journal-title":"Discrete Appl Math"},{"key":"9981_CR2","doi-asserted-by":"crossref","first-page":"1482","DOI":"10.1016\/j.disc.2009.09.020","volume":"310","author":"M Ast\u00e9","year":"2010","unstructured":"Ast\u00e9 M, Havet F, Linhares-Sales C (2010) Grundy number and products of graphs. Discrete Math 310:1482\u20131490","journal-title":"Discrete Math"},{"key":"9981_CR3","unstructured":"Berge C (1961) F\u00e4rbung von Graphen, deren S\u00e4mtliche bzw. deren ungerade Kreise starr sind, Wiss. Zeitung, Martin Luther Univ. Halle-Wittenberg, 114"},{"key":"9981_CR4","first-page":"225","volume":"50","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s B, Erd\u0151s P (1998) Graphs of extremal weights. Ars Combin 50:225\u2013233","journal-title":"Ars Combin"},{"key":"9981_CR5","doi-asserted-by":"crossref","first-page":"2088","DOI":"10.1016\/j.disc.2012.03.029","volume":"312","author":"G Chang","year":"2012","unstructured":"Chang G, Hsu H (2012) First-fit chromatic numbers of $$d$$ d -degenerate graphs. Discrete Math 312:2088\u20132090","journal-title":"Discrete Math"},{"key":"9981_CR6","doi-asserted-by":"crossref","DOI":"10.1201\/9781584888017","volume-title":"Chromatic Graph Theory","author":"G Chartrand","year":"2008","unstructured":"Chartrand G, Zhang P (2008) Chromatic Graph Theory. Chapman and Hall\/CRC, Boca Raton"},{"key":"9981_CR7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(79)90067-4","volume":"27","author":"CA Christen","year":"1979","unstructured":"Christen CA, Selkow SM (1979) Some perfect coloring properties of graphs. J Combin Theory Ser B 27:49\u201359","journal-title":"J Combin Theory Ser B"},{"key":"9981_CR8","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/0095-8956(82)90005-3","volume":"27","author":"EJ Cockayne","year":"1982","unstructured":"Cockayne EJ, Thomason AG (1982) Ordered colorings of graphs. J Combin Theory Ser B 27:286\u2013292","journal-title":"J Combin Theory Ser B"},{"key":"9981_CR9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"GA Dirac","year":"1961","unstructured":"Dirac GA (1961) On rigid circuit graphs. Abh Math Sem Univ Hamurg 25:71\u201376","journal-title":"Abh Math Sem Univ Hamurg"},{"key":"9981_CR10","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1016\/j.dam.2012.11.004","volume":"161","author":"TR Divni\u0107","year":"2013","unstructured":"Divni\u0107 TR, Pavlovi\u0107 LR (2013) Proof of the first part of the conjecture of Aouchiche and Hansen about the Randi\u0107 index. Discrete Appl Math 161:953\u2013960","journal-title":"Discrete Appl Math"},{"key":"9981_CR11","doi-asserted-by":"crossref","first-page":"5","DOI":"10.7151\/dmgt.1339","volume":"27","author":"B Effantin","year":"2007","unstructured":"Effantin B, Kheddouci H (2007) Grundy number of graphs. Discuss Math Graph Theory 27:5\u201318","journal-title":"Discuss Math Graph Theory"},{"key":"9981_CR12","first-page":"99","volume-title":"On the chromatic number of a graph and its complements, theory of graphs","author":"HJ Finck","year":"1966","unstructured":"Finck HJ (1966) On the chromatic number of a graph and its complements, theory of graphs. Proceedings of the Colloquium, Tihany, Hungary, pp 99\u2013113"},{"key":"9981_CR13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1002\/jgt.20327","volume":"59","author":"Z F\u00fcredi","year":"2008","unstructured":"F\u00fcredi Z, Gy\u00e1rf\u00e1s A, S\u00e1rk\u00f6zy GN, Selkow S (2008) Inequalities for the First-fit chromatic number. J Graph Theory 59:75\u201388","journal-title":"J Graph Theory"},{"key":"9981_CR14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.disc.2014.03.023","volume":"328","author":"N Gastineau","year":"2014","unstructured":"Gastineau N, Kheddouci H, Togni O (2014) On the family of r-regular graphs with Grundy number r+1. Discrete Math 328:5\u201315","journal-title":"Discrete Math"},{"key":"9981_CR15","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0012-365X(78)90178-4","volume":"24","author":"MC Golumbic","year":"1978","unstructured":"Golumbic MC (1978) Trivially perfect graphs. Discrete Math 24:105\u2013107","journal-title":"Discrete Math"},{"key":"9981_CR16","first-page":"6","volume":"2","author":"PM Grundy","year":"1939","unstructured":"Grundy PM (1939) Mathematics and games. Eureka 2:6\u20138","journal-title":"Eureka"},{"key":"9981_CR17","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/S0021-9800(70)80072-2","volume":"8","author":"F Harary","year":"1970","unstructured":"Harary F, Hedetniemi S (1970) The achromatic number of a graph. J Combin Theory 8:154\u2013161","journal-title":"J Combin Theory"},{"key":"9981_CR18","volume-title":"Graph Coloring Problems","author":"TR Jensen","year":"1995","unstructured":"Jensen TR, Toft B (1995) Graph Coloring Problems. A Wiely-Interscience Publication, Wiely, New York"},{"key":"9981_CR19","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1137\/S0895480191218861","volume":"8","author":"HA Kierstead","year":"1995","unstructured":"Kierstead HA, Penrice SG, Trotter WT (1995) On-Line and first-fit coloring of graphs that do not induce $$P_{5}$$ P 5 . SIAM J Disc Math 8:485\u2013498","journal-title":"SIAM J Disc Math"},{"key":"9981_CR20","unstructured":"Li X, Gutman I (2006) Mathematical Aspects of Randi\u0107-Type Molecular Structure Descriptors, Mathematical Chemistry Monographs No. 1, Kragujevac"},{"key":"9981_CR21","doi-asserted-by":"crossref","first-page":"2448","DOI":"10.1016\/j.disc.2010.05.009","volume":"310","author":"X Li","year":"2010","unstructured":"Li X, Shi Y (2010) On a relation between the Randi\u0107 index and the chromatic number. Discrete Math 310:2448\u20132451","journal-title":"Discrete Math"},{"key":"9981_CR22","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1016\/j.aml.2010.12.024","volume":"24","author":"J Liu","year":"2011","unstructured":"Liu J, Liang M, Cheng B, Liu B (2011) A proof for a conjecture on the Randi\u0107 index of graphs with diameter. Appl Math Lett 24:752\u2013756","journal-title":"Appl Math Lett"},{"key":"9981_CR23","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.disc.2012.10.012","volume":"313","author":"B Liu","year":"2013","unstructured":"Liu B, Pavlovi\u0107 LR, Divni\u0107 TR, Liu J, Stojanovi\u0107 MM (2013) On the conjecture of Aouchiche and Hansen about the Randi\u0107 index. Discrete Math 313:225\u2013235","journal-title":"Discrete Math"},{"key":"9981_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jctb.1996.0030","volume":"67","author":"SE Markossian","year":"1996","unstructured":"Markossian SE, Gasparian GS, Reed BA (1996) $$\\beta $$ \u03b2 -perfect graphs. J Combin Theory Ser B 67:1\u201311","journal-title":"J Combin Theory Ser B"},{"key":"9981_CR25","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2306658","volume":"63","author":"EA Nordhaus","year":"1956","unstructured":"Nordhaus EA, Gaddum JW (1956) On complementary graphs. Am Math Monthly 63:175\u2013177","journal-title":"On complementary graphs. Am Math Monthly"},{"key":"9981_CR26","doi-asserted-by":"crossref","first-page":"6609","DOI":"10.1021\/ja00856a001","volume":"97","author":"M Randi\u0107","year":"1975","unstructured":"Randi\u0107 M (1975) On characterization of molecular branching. J Am Chem Soc 97:6609\u20136615","journal-title":"J Am Chem Soc"},{"key":"9981_CR27","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1090\/S0002-9939-1962-0172273-0","volume":"13","author":"ES Wolks","year":"1962","unstructured":"Wolks ES (1962) The comparability graph of a tree. Proc Am Math Soc 13:789\u2013795","journal-title":"Proc Am Math Soc"},{"key":"9981_CR28","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.dam.2014.06.024","volume":"178","author":"B Wu","year":"2014","unstructured":"Wu B, Yan J, Yang X (2014) Randi\u0107 index and coloring number of a graph. Discrete Appl Math 178:163\u2013165","journal-title":"Discrete Appl Math"},{"key":"9981_CR29","first-page":"325","volume":"31","author":"M Zaker","year":"2005","unstructured":"Zaker M (2005) Grundy chromatic number of the complement of bipartite graphs. Australas J Comb 31:325\u2013329","journal-title":"Australas J Comb"},{"key":"9981_CR30","doi-asserted-by":"crossref","first-page":"3166","DOI":"10.1016\/j.disc.2005.06.044","volume":"306","author":"M Zaker","year":"2006","unstructured":"Zaker M (2006) Results on the Grundy chromatic number of graphs. Discrete Math 306:3166\u20133173","journal-title":"Discrete Math"},{"key":"9981_CR31","doi-asserted-by":"crossref","first-page":"2567","DOI":"10.1016\/j.dam.2007.07.002","volume":"155","author":"M Zaker","year":"2007","unstructured":"Zaker M (2007) Inequalities for the Grundy chromatic number of graphs. Discrete Appl Math 155:2567\u20132572","journal-title":"Discrete Appl Math"},{"key":"9981_CR32","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1002\/jgt.20298","volume":"58","author":"M Zaker","year":"2008","unstructured":"Zaker M (2008) New bounds for the chromatic number of graphs. J Graph Theory 58:110\u2013122","journal-title":"J Graph Theory"},{"key":"9981_CR33","unstructured":"Zaker M (2011) $$(\\delta, {\\chi }_{{ FF}})$$ ( \u03b4 , \u03c7 F F ) -bounded families of graphs, unpublished manuscript"},{"key":"9981_CR34","doi-asserted-by":"crossref","unstructured":"Zaker M, Soltani H (2015) First-fit colorings of graphs with no cycles of a prescribed even length. J Comb Optim (in press)","DOI":"10.1007\/s10878-015-9900-z"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9981-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9981-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9981-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9981-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T15:33:04Z","timestamp":1567438384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9981-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,21]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["9981"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9981-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,21]]}}}