{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T00:51:19Z","timestamp":1660265479173},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,11,27]],"date-time":"2007-11-27T00:00:00Z","timestamp":1196121600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1007\/s00236-007-0064-x","type":"journal-article","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T04:01:31Z","timestamp":1196049691000},"page":"79-91","source":"Crossref","is-referenced-by-count":4,"title":["On-line graph coloring of $${\\mathbb{P}_5}$$ -free graphs"],"prefix":"10.1007","volume":"45","author":[{"given":"Iwona","family":"Cie\u015blik","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,11,27]]},"reference":[{"key":"64_CR1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF02352694","volume":"21","author":"G. Bacs\u00f3","year":"1990","unstructured":"Bacs\u00f3 G. and Tuza Z. (1990). Dominating cliques in $${\\mathbb{P}}_5$$ -free graphs Period. Math. Hungar. 21: 303\u2013308","journal-title":"Period. Math. Hungar."},{"key":"64_CR2","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1017\/S0022481200051549","volume":"41","author":"D.R. Bean","year":"1976","unstructured":"Bean D.R. (1976). Effective coloration. J. Symb. Log. 41: 469\u2013480","journal-title":"J. Symb. Log."},{"key":"64_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00236-005-0167-1","volume":"42","author":"I. Cie\u015blik","year":"2005","unstructured":"Cie\u015blik I. (2005). On-line coloring and cliques covering for $${\\mathbb{K}}_{s,t}$$ -free graphs Acta Inform. 42: 1\u201322","journal-title":"Acta Inform."},{"key":"64_CR4","unstructured":"Cie\u015blik, I., Kozik, M., Micek, P.: On-line coloring of $${\\mathbb{I}}_s$$ -free graphs and co-planar graphs. In: Computational Logic and Applications, CLA \u201905, Discrete Mathematics and Theoretical Computer Science Proceedings AF, pp. 61\u201368 (2006)"},{"key":"64_CR5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0012-365X(90)90353-J","volume":"86","author":"M. Cozzens","year":"1990","unstructured":"Cozzens M. and Kelleher L. (1990). Dominating cliques in graphs. Discret. Math. 86: 101\u2013116","journal-title":"Discret. Math."},{"key":"64_CR6","volume-title":"Graph Theory","author":"R. Diestel","year":"1997","unstructured":"Diestel R. (1997). Graph Theory. Springer, New York"},{"key":"64_CR7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(94)00155-X","volume":"146","author":"J. Fouquet","year":"1995","unstructured":"Fouquet J., Giakoumakis V., Maire F. and Thuillier H. (1995). On graphs without $${\\mathbb{P}}_5$$ and $$\\overline{\\mathbb{P}}_5$$ Discret. Math. 146: 33\u201344","journal-title":"Discret. Math."},{"key":"64_CR8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F. Gavril","year":"1974","unstructured":"Gavril F. (1974). The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory B 16: 261\u2013273","journal-title":"J. Comb. Theory B"},{"key":"64_CR9","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. and Lehel J. (1988). On-line and first fit colorings of graphs. J. Gr. Theory 12: 217\u2013227","journal-title":"J. Gr. Theory"},{"key":"64_CR10","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01206361","volume":"11","author":"A. Gy\u00e1rf\u00e1s","year":"1991","unstructured":"Gy\u00e1rf\u00e1s A. and Lehel J. (1991). Effective on-line coloring of $${\\mathbb{P}}_5$$ -free graphs Combinatorica 11: 181\u2013184","journal-title":"Combinatorica"},{"issue":"3","key":"64_CR11","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/S089548019631030X","volume":"12","author":"A. Gy\u00e1rf\u00e1s","year":"1999","unstructured":"Gy\u00e1rf\u00e1s A., Kir\u00e1ly Z. and Lehel J. (1999). On-line 3-chromatic Graphs I. Triangle-Free Graphs. SIAM J. Discret. Math. 12(3): 385\u2013411","journal-title":"SIAM J. Discret. Math."},{"key":"64_CR12","first-page":"143","volume":"33","author":"H.A. Kierstead","year":"1981","unstructured":"Kierstead H.A. and Trotter W.T. (1981). An extremal problem in recursive combinatorics. Congr. Numer. 33: 143\u2013153","journal-title":"Congr. Numer."},{"key":"64_CR13","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1137\/S0895480191218861","volume":"8","author":"H.A. Kierstead","year":"1995","unstructured":"Kierstead H.A., Penrice S.G. and Trotter W.T. (1995). On-line and first-fit coloring of graphs which do not induce $${\\mathbb{P}_5}$$ SIAM J. Discret. Math. 8: 485\u2013498","journal-title":"SIAM J. Discret. Math."},{"key":"64_CR14","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1051\/ita\/1995290504231","volume":"29","author":"M. \u015alusarek","year":"1995","unstructured":"\u015alusarek M. (1995). Optimal on-line coloring of circular arc graphs. Inform. Theor. Appl. 29: 423\u2013429","journal-title":"Inform. Theor. Appl."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-007-0064-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-007-0064-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-007-0064-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T09:41:54Z","timestamp":1558690914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-007-0064-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,27]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["64"],"URL":"https:\/\/doi.org\/10.1007\/s00236-007-0064-x","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,27]]}}}