{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,12]],"date-time":"2024-05-12T20:40:21Z","timestamp":1715546421957},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s00493-013-2542-9","type":"journal-article","created":{"date-parts":[[2013,6,24]],"date-time":"2013-06-24T05:26:10Z","timestamp":1372051570000},"page":"319-334","source":"Crossref","is-referenced-by-count":5,"title":["Circumference, chromatic number and online coloring"],"prefix":"10.1007","volume":"33","author":[{"given":"Ajit A.","family":"Diwan","sequence":"first","affiliation":[]},{"given":"Sreyash","family":"Kenkre","sequence":"additional","affiliation":[]},{"given":"Sundar","family":"Vishwanathan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,6,21]]},"reference":[{"key":"2542_CR1","volume-title":"Introduction To Algorithms \u2014 Second Edition","author":"T Cormen","year":"2001","unstructured":"T. Cormen, Ch. Leiserson, R. Rivest, C. Stein: Introduction To Algorithms \u2014 Second Edition, The MIT Press, 2001."},{"key":"2542_CR2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0012-365X(98)00324-0","volume":"200","author":"P Erd\u0151s","year":"1999","unstructured":"P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, R. H. Schelp: The number of cycle lengths in graphs of given minimum degree and girth, Discrete Mathematics 200 (1999) 55\u201360.","journal-title":"Discrete Mathematics"},{"key":"2542_CR3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0012-365X(92)90037-G","volume":"103","author":"A Gy\u00e1rf\u00e1s","year":"1992","unstructured":"A. Gy\u00e1rf\u00e1s: Graphs with k odd cycle lengths, Discrete Mathematics 103 (1992) 41\u201348.","journal-title":"Discrete Mathematics"},{"key":"2542_CR4","first-page":"211","volume-title":"Symposium on Discrete Algorithms","author":"M Halld\u00f3rsson","year":"1992","unstructured":"M. Halld\u00f3rsson, M. Szegedy: Lower Bounds for On-Line Graph Coloring, Symposium on Discrete Algorithms, SODA, 211\u2013216, (1992)."},{"issue":"4","key":"2542_CR5","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1002\/jgt.20209","volume":"54","author":"S Kenkre","year":"2007","unstructured":"S. Kenkre, S. Vishwanathan: A Bound On The Chromatic Number Using The Longest Odd Cycle Length, Journal of Graph Theory 54(4) (2007), 267\u2013276.","journal-title":"Journal of Graph Theory"},{"key":"2542_CR6","series-title":"LNCS","volume-title":"Coloring Graphs Online","author":"H Kierstead","year":"1998","unstructured":"H. Kierstead: Coloring Graphs Online, Online Algorithms, LNCS vol. 1442, Springer Berlin\/Heidelberg, 1998."},{"key":"2542_CR7","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0012-365X(89)90096-4","volume":"75","author":"L Lov\u00e1sz","year":"1989","unstructured":"L. Lov\u00e1sz, M. Saks, W. T. Trotter: An Online Graph Coloring Algorithm With Sublinear Performance Ratio, Discrete Mathematics 75 (1989), 319\u2013325.","journal-title":"Discrete Mathematics"},{"issue":"3","key":"2542_CR8","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1002\/jgt.20450","volume":"64","author":"Ch L\u00f6wenstein","year":"2010","unstructured":"Ch. L\u00f6wenstein, D. Rautenbach, I. Schiermeyer: Cycle length parities and the chromatic number, Journal of Graph Theory 64(3) (2010), 210\u2013218.","journal-title":"Journal of Graph Theory"},{"key":"2542_CR9","volume-title":"Graph Coloring and the Probabilistic Method","author":"M Molloy","year":"2000","unstructured":"M. Molloy, Bruce Reed: Graph Coloring and the Probabilistic Method, Springer Berlin, 2000."},{"key":"2542_CR10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.disc.2003.11.055","volume":"286","author":"P Mih\u00f3k","year":"2004","unstructured":"P. Mih\u00f3k, I. Schiermeyer: Cycle lengths and chromatic number of graphs, Discrete Mathematics 286 (2004), 147\u2013149.","journal-title":"Discrete Mathematics"},{"key":"2542_CR11","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0012-365X(99)00109-0","volume":"211","author":"A Nilli","year":"2000","unstructured":"A. Nilli: Triangle-free graphs with large chromatic numbers, Discrete Mathematics 211 (2000), 261\u2013262.","journal-title":"Discrete Mathematics"},{"key":"2542_CR12","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/BF03322762","volume":"41","author":"I Schiermeyer","year":"2002","unstructured":"I. Schiermeyer, B. Randerath: Chromatic Number of Graphs each Path of which is 3-colorable, Result. Math 41 (2002), 150\u2013155.","journal-title":"Result. Math"},{"key":"2542_CR13","unstructured":"B. Sudakov, J. Verstra\u00ebte: Cycle lengths in sparse graphs, Preprint. To be published in Combinatorica."},{"key":"2542_CR14","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0095-8956(92)90042-V","volume":"55","author":"Zs Tuza","year":"1992","unstructured":"Zs. Tuza: Graph coloring in linear time, Journal of Combinatorial Theory (B) 55 (1992), 236\u2013243.","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"2542_CR15","volume-title":"Extremal Problems for Cycles in Graphs","author":"J Verstra\u00ebte","year":"2008","unstructured":"J. Verstra\u00ebte: Extremal Problems for Cycles in Graphs, Invited lecture. Oberwolfach Combinatorics Workshop. January 6\u201312th 2008, http:\/\/owpdb.mfo.de\/show workshop?id=609 ."},{"key":"2542_CR16","volume-title":"Introduction to Graph Theory \u2014 second edition","author":"D West","year":"2001","unstructured":"D. West: Introduction to Graph Theory \u2014 second edition, Prentice Hall, 2001."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-013-2542-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-013-2542-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-013-2542-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,12]],"date-time":"2024-05-12T20:20:13Z","timestamp":1715545213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-013-2542-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["2542"],"URL":"http:\/\/dx.doi.org\/10.1007\/s00493-013-2542-9","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6]]}}}
