{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:10:11Z","timestamp":1787508611599,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540343752","type":"print"},{"value":"9783540343783","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_28","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T06:34:15Z","timestamp":1149230055000},"page":"284-295","source":"Crossref","is-referenced-by-count":3,"title":["On-Line Coloring of H-Free Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"H. J.","family":"Broersma","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Capponi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D.","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London and Elsevier, New York (1976)","DOI":"10.1007\/978-1-349-03521-2"},{"key":"28_CR2","first-page":"588","volume":"5","author":"M. Chrobak","year":"1984","unstructured":"Chrobak, M., \u015alusarek, M.: Problem 84-23. Journal of Algorithms\u00a05, 588 (1984)","journal-title":"Journal of Algorithms"},{"key":"28_CR3","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0925-7721(02)00089-5","volume":"23","author":"T. Erlebach","year":"2002","unstructured":"Erlebach, T., Fiala, J.: On-line coloring of geometric intersection graphs. Computational Geometry: Theory and Applications\u00a023, 243\u2013255 (2002)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"28_CR4","unstructured":"Gy\u00e1rf\u00e1s, A., Kir\u00e1ly, Z., Lehel, J.: On-line competitive coloring algorithms. Technical report TR-9703-1 (1997), Available at: http:\/\/www.cs.elte.hu\/tr97\/"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0012-365X(96)00359-7","volume":"177","author":"A. Gy\u00e1rf\u00e1s","year":"1997","unstructured":"Gy\u00e1rf\u00e1s, A., Kir\u00e1ly, Z., Lehel, J.: On-line 3-chromatic graphs. II. Critical graphs. Discrete Mathematics\u00a0177, 99\u2013122 (1997)","journal-title":"Discrete Mathematics"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jgt.3190120212","volume":"12","author":"A. Gy\u00e1rf\u00e1s","year":"1988","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J.: On-line and first-fit colorings of graphs. Journal of Graph Theory\u00a012, 217\u2013227 (1988)","journal-title":"Journal of Graph Theory"},{"key":"28_CR7","first-page":"168","volume":"29C","author":"A. Gy\u00e1rf\u00e1s","year":"1990","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J.: First fit and on-line chromatic number of families of graphs. Ars Combinatorica\u00a029C, 168\u2013176 (1990)","journal-title":"Ars Combinatorica"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01206361","volume":"11","author":"A. Gy\u00e1rf\u00e1s","year":"1991","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J.: Effective on-line coloring of P 5-free graphs. Combinatorica\u00a011, 181\u2013184 (1991)","journal-title":"Combinatorica"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M.: Online coloring known graphs. Electronic Journal of Combinatorics\u00a07, Research Paper 7, 9pp (2000)","DOI":"10.37236\/1485"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1137\/0401048","volume":"1","author":"H.A. Kierstead","year":"1988","unstructured":"Kierstead, H.A.: The linearity of first-fit coloring of interval graphs. SIAM Journal on Discrete Mathematics\u00a01, 526\u2013530 (1988)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BFb0029574","volume-title":"Online Algorithms","author":"H.A. Kierstead","year":"1998","unstructured":"Kierstead, H.A.: Coloring graphs on-line. In: Fiat, Woeginger (eds.) Online Algorithms: the state of the art. LNCS, vol.\u00a01442, pp. 281\u2013305. Springer, Heidelberg (1998)"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1002\/jgt.3190180203","volume":"18","author":"H. Kierstead","year":"1994","unstructured":"Kierstead, H., Penrice, S.G.: Radius two trees specify \u03c7-bounded classes. Journal of Graph Theory\u00a018, 119\u2013129 (1994)","journal-title":"Journal of Graph Theory"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1137\/S0895480192224737","volume":"7","author":"H. Kierstead","year":"1994","unstructured":"Kierstead, H., Penrice, S.G., Trotter, W.: On-line graph coloring and recursive graph theory. SIAM Journal on Discrete Mathematics\u00a07, 72\u201389 (1994)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(95)00189-4","volume":"150","author":"K. Kolossa","year":"1996","unstructured":"Kolossa, K.: On the on-line chromatic number of the family of on-line 3-chromatic graphs. Discrete Mathematics\u00a0150, 205\u2013230 (1996)","journal-title":"Discrete Mathematics"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0012-365X(89)90096-4","volume":"75","author":"L. Lov\u00e1sz","year":"1989","unstructured":"Lov\u00e1sz, L., Saks, M., Trotter, W.T.: An on-line graph coloring algorithm with sublinear performance ratio. Discrete Mathematics\u00a075, 319\u2013325 (1989)","journal-title":"Discrete Mathematics"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-003-0540-1","volume":"20","author":"B. Randerath","year":"2004","unstructured":"Randerath, B., Schiermeyer, I.: Vertex colouring and forbidden subgraphs\u00a0\u2013 a survey. Graphs and Combinatorics\u00a020, 1\u201340 (2004)","journal-title":"Graphs and Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:05:42Z","timestamp":1605625542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11758471_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}