{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T13:36:40Z","timestamp":1649165800097},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"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":[[1996,12]]},"DOI":"10.1007\/bf01271267","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T04:35:40Z","timestamp":1111638940000},"page":"479-491","source":"Crossref","is-referenced-by-count":2,"title":["On-line coloring of perfect graphs"],"prefix":"10.1007","volume":"16","author":[{"given":"H. A.","family":"Kierstead","sequence":"first","affiliation":[]},{"given":"K.","family":"Kolossa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1017\/S0022481200051549","volume":"41","author":"D. Bean","year":"1976","unstructured":"D. Bean: Effective coloration,J. Symbolic Logic 41 (1976), 469?480.","journal-title":"J. Symbolic Logic"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/jgt.3190120212","volume":"12","author":"A. Gy\u00e1rf\u00e1s","year":"1988","unstructured":"A. Gy\u00e1rf\u00e1s, andJ. Lehel: On-line and first-fit coloring of graphs,J. of Graph Theory 12 (1988), 217?227.","journal-title":"J. of Graph Theory"},{"key":"CR3","first-page":"168","volume":"29C","author":"A. Gy\u00e1rf\u00e1s","year":"1990","unstructured":"A. Gy\u00e1rf\u00e1s, andJ. Lehel: First-Fit and on-line chromatic number of families of graphs,Ars Combinatorica 29C (1990), 168?176.","journal-title":"Ars Combinatorica"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"S. Irani: Coloring inductive graphs on-line,Proceedings of the 3lst Annual Symposium on the Foundations of Computer Science, (1990), 470?479.","DOI":"10.1109\/FSCS.1990.89568"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1137\/0401048","volume":"1","author":"H. A. Kierstead","year":"1988","unstructured":"H. A. Kierstead: The linearity of First-Fit for coloring interval graphs,SIAM J. on Discrete Math.,1 (1988), 526?530.","journal-title":"SIAM J. on Discrete Math."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1137\/S0895480191218861","volume":"8","author":"H. A. Kierstead","year":"1995","unstructured":"H. A. Kierstead, S. G. Penrice, andW. T. Trotter: First-Fit and on-line coloring of graphs which do not induceP 5,SIAM J. on Discrete Mathematics,8 (1995), 485?498.","journal-title":"SIAM J. on Discrete Mathematics"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1137\/S0895480192224737","volume":"7","author":"H. A. Kierstead","year":"1994","unstructured":"H. A. Kierstead, S. G. Penrice, andW.T. Trotter: On-line graph coloring and recursive graph theory,SIAM J. on Discrete Math. 7 (1994), 72?89.","journal-title":"SIAM J. on Discrete Math."},{"key":"CR8","first-page":"143","volume":"33","author":"H. A. Kierstead","year":"1981","unstructured":"H. A. Kierstead, andW. T. Trotter: An extremal problem in recursive combinatorics,Congressus Numerantium,33 (1981), 143?153.","journal-title":"Congressus Numerantium"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz, M. Saks, andW. T. Trotter: An online graph coloring algorithm with sublinear performance ratio,Discrete Math., (1989), 319?325.","DOI":"10.1016\/S0167-5060(08)70584-3"},{"key":"CR10","unstructured":"M. Szegedy: Private communication."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/0196-6774(92)90061-G","volume":"13","author":"S. Vishwanathan","year":"1992","unstructured":"S. Vishwanathan: Randomized online graph coloring,J. Algorithms,13 (1992), 657?669.","journal-title":"J. Algorithms"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01271267.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01271267\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01271267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T12:55:51Z","timestamp":1586177751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01271267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["BF01271267"],"URL":"https:\/\/doi.org\/10.1007\/bf01271267","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}