{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T13:08:10Z","timestamp":1748437690858},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,5,14]],"date-time":"2015-05-14T00:00:00Z","timestamp":1431561600000},"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":[[2016,10]]},"DOI":"10.1007\/s10878-015-9900-z","type":"journal-article","created":{"date-parts":[[2015,5,13]],"date-time":"2015-05-13T11:58:56Z","timestamp":1431518336000},"page":"775-783","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["First-Fit colorings of graphs with no cycles of a prescribed even length"],"prefix":"10.1007","volume":"32","author":[{"given":"Manouchehr","family":"Zaker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hossein","family":"Soltani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,14]]},"reference":[{"key":"9900_CR1","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1137\/060672479","volume":"22","author":"J Balogh","year":"2008","unstructured":"Balogh J, Hartke SG, Liu Q, Yu G (2008) On the first-fit chromatic number of graphs. SIAM J Discret Math 22:887\u2013900","journal-title":"SIAM J Discret Math"},{"key":"9900_CR2","volume-title":"Extremal graph theory","author":"B Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s B (2004) Extremal graph theory. Dover Publications Inc., New York"},{"key":"9900_CR3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0095-8956(74)90052-5","volume":"16","author":"JA Bondy","year":"1974","unstructured":"Bondy JA, Simonovits M (1974) Cycles of even length in graphs. J. Comb. Theory Ser B 16:97\u2013105","journal-title":"J. Comb. Theory Ser B"},{"key":"9900_CR4","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1017\/S0963548398003678","volume":"7","author":"T Emden-Weinert","year":"1998","unstructured":"Emden-Weinert T, Hougardy S, Kreuter B (1998) Uniquely colourable graphs and the hardness of colouring graphs of large girth. Comb Probab Comput 7:375\u2013386","journal-title":"Comb Probab Comput"},{"key":"9900_CR5","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 SM (2008) Inequalities for the first-fit chromatic number. J Gr Theory 59:75\u201388","journal-title":"J Gr Theory"},{"key":"9900_CR6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/jgt.3190120212","volume":"12","author":"A Gy\u00e1rf\u00e1s","year":"1988","unstructured":"Gy\u00e1rf\u00e1s A, Lehel J (1988) On-line and first-fit coloring of graphs. J Gr Theory 12:217\u2013227","journal-title":"J Gr Theory"},{"key":"9900_CR7","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/978-3-642-17493-3_17","volume":"6478","author":"F Havet","year":"2010","unstructured":"Havet F, Sampaio L (2010) On the Grundy number of a graph. Lect Notes Comput Sci 6478:170\u2013179","journal-title":"Lect Notes Comput Sci"},{"key":"9900_CR8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01294263","volume":"11","author":"S Irani","year":"1994","unstructured":"Irani S (1994) Coloring inductive graphs on-line. Algorithmica 11:53\u201372","journal-title":"Algorithmica"},{"issue":"4","key":"9900_CR9","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 first fit coloring of graphs that do not induce $$P_{5}$$ P 5 . SIAM J Discret Math 8(4):485\u2013498","journal-title":"SIAM J Discret Math"},{"unstructured":"Kierstead HA, Trotter WT (1991) On-line graph coloring. In: McGeoch LA, Sleator DD (eds) On-line algorithms: Proceedings of DIMACS workshop, Feb 11\u201313, 1991. American Mathematical Society 1992, pp 85\u201392","key":"9900_CR10"},{"key":"9900_CR11","first-page":"7","volume":"9","author":"G Kortsarz","year":"2007","unstructured":"Kortsarz G (2007) A lower bound for approximating Grundy number. Discret Math Theory Comput Sci 9:7\u201321","journal-title":"Discret Math Theory Comput Sci"},{"key":"9900_CR12","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0012-365X(97)89267-9","volume":"162","author":"F Maffray","year":"1996","unstructured":"Maffray F, Preissmann M (1996) On the $$NP$$ N P -completeness of the $$k$$ k -colorability problem for triangle-free graphs. Discret Math 162:313\u2013317","journal-title":"Discret Math"},{"key":"9900_CR13","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0012-365X(77)90044-9","volume":"20","author":"J Spencer","year":"1977","unstructured":"Spencer J (1977) Asymptotic lower bounds for Ramsey functions. Discret Math 20:69\u201376","journal-title":"Discret Math"},{"key":"9900_CR14","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":"9900_CR15","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. Discret Math 306:3166\u20133173","journal-title":"Discret Math"},{"key":"9900_CR16","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. Discret Appl Math 155:2567\u20132572","journal-title":"Discret Appl Math"},{"unstructured":"Zaker M (2009) Some colorful results for graphs without an even cycle, SBU Combinatorics Day, March 4, 2009. Shahid Beheshti University, Tehran","key":"9900_CR17"},{"unstructured":"Zaker M (2009) On the first-fit coloring of graphs, In: Proccedings of international conference on discrete mathematics, algebra and their applications (DIMA09), Oct 19\u201322, 2009. Minsk, Belarus","key":"9900_CR18"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9900-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9900-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9900-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:26Z","timestamp":1559262206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9900-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,14]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9900"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9900-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2015,5,14]]}}}