{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:24:35Z","timestamp":1760707475157},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"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":[[1991,6]]},"DOI":"10.1007\/bf01206361","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T14:33:38Z","timestamp":1109255618000},"page":"181-184","source":"Crossref","is-referenced-by-count":20,"title":["Effective on-line coloring ofP 5-free graphs"],"prefix":"10.1007","volume":"11","author":[{"given":"Andr\ufffds","family":"Gy\ufffdrf\ufffds","sequence":"first","affiliation":[]},{"given":"Jen?","family":"Lehel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"413","DOI":"10.4064\/am-19-3-4-413-441","volume":"3?4","author":"A. Gy\ufffdrf\ufffds","year":"1987","unstructured":"A. Gy\ufffdrf\ufffds: Problems from the world surrounding perfect graphs,Zastosowania Matematyki Applicationes Mathemaicae XIX.3?4 (1987), 413?441.","journal-title":"Zastosowania Matematyki Applicationes Mathemaicae XIX"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/jgt.3190120212","volume":"12","author":"A. Gy\ufffdrf\ufffds","year":"1988","unstructured":"A. Gy\ufffdrf\ufffds, andJen? Lehel: On-line and first fit colorings of graphs,Journal of Graph Theory,12 (1988) 217?227.","journal-title":"Journal of Graph Theory"},{"key":"CR3","unstructured":"A. Gy\ufffdrf\ufffds, andJen? Lehel: First fit and on-line chromatic number of families of graphs,Ars Combinatoria,29 B (1990)."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"H. A. Kierstead: The linearity of First-Fit coloring of interval graphs, preprint, 1988.","DOI":"10.1137\/0401048"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0012-365X(89)90096-4","volume":"75","author":"L. Lov\ufffdsz","year":"1989","unstructured":"L. Lov\ufffdsz, M. Saks, andW. T. Trotter: An on-line graph coloring algorithm with sublinear performance ration,Discrete Math.,75, (1989) 319?325.","journal-title":"Discrete Math."},{"key":"CR6","unstructured":"D. P. Sumner: Subtrees of a graph and the chromatic number, in: Theory and Applications of Graphs (ed. G. Chartrand), 1981, 557?576."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01206361.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01206361\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01206361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T09:40:07Z","timestamp":1683020407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01206361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01206361"],"URL":"https:\/\/doi.org\/10.1007\/bf01206361","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}