{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T23:39:45Z","timestamp":1777678785887,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2008,10,1]],"date-time":"2008-10-01T00:00:00Z","timestamp":1222819200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s00373-008-0801-0","type":"journal-article","created":{"date-parts":[[2008,10,25]],"date-time":"2008-10-25T05:24:20Z","timestamp":1224912260000},"page":"413-428","source":"Crossref","is-referenced-by-count":16,"title":["Linear Chromatic Bounds for a Subfamily of 3K 1-free Graphs"],"prefix":"10.1007","volume":"24","author":[{"given":"S. A.","family":"Choudum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Karthick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. A.","family":"Shalu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,10,26]]},"reference":[{"key":"801_CR1","unstructured":"Brown, J.I., Corneil, D.G.: Perfect colorings. Ars Combinatoria 30, 141\u2013159 (1990)"},{"key":"801_CR2","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph theory and its applications. The Macmillan Press Ltd., London (1976)","DOI":"10.1007\/978-1-349-03521-2"},{"key":"801_CR3","unstructured":"Choudum, S.A., Shalu, M.A.: The class of {3K 1, C 4}-free graphs. Australasian Journal of Combinatorics 32, 111\u2013116 (2005)"},{"key":"801_CR4","doi-asserted-by":"crossref","unstructured":"Choudum, S.A., Karthick, T., Shalu, M.A.: Perfect colouring and linearly \u03c7-bound P 6-free graphs. Journal of Graph Theory 54(4), 293\u2013306 (2007)","DOI":"10.1002\/jgt.20212"},{"key":"801_CR5","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M.: Berge trigraphs. Journal of Graph Theory 53(1), 1\u201355 (2006)","DOI":"10.1002\/jgt.20165"},{"key":"801_CR6","unstructured":"Chudnovsky, M., Seymour, P.: Claw-free graphs VII. Colouring claw-free graphs. Manuscript (2004)"},{"key":"801_CR7","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Seymour, P., Robertson, N., Thomas, R.: The strong perfect graph theorem. Annals of Mathematics 164(1), 51\u2013229 (2006)","DOI":"10.4007\/annals.2006.164.51"},{"key":"801_CR8","doi-asserted-by":"crossref","unstructured":"Dhurandhar, M.: On the chromatic number of a graph with two forbidden subgraphs. Journal of Combinatorial Theory, Series B 46, 1\u20136 (1989)","DOI":"10.1016\/0095-8956(89)90002-6"},{"key":"801_CR9","doi-asserted-by":"crossref","unstructured":"Fouquet, J.L., Giakoumakis, V., Maire, F., Thuillier, H.: On graphs without P 5 and $$\\overline{P_5}$$ . Discrete Mathematics 146, 33\u201344 (1995)","DOI":"10.1016\/0012-365X(94)00155-X"},{"key":"801_CR10","doi-asserted-by":"crossref","unstructured":"Gy\u00e1rf\u00e1s, A.: Problems from the world surrounding perfect graphs. Zastosowania Matematyki Applicationes Mathematicae 19, 413\u2013441 (1987)","DOI":"10.4064\/am-19-3-4-413-441"},{"key":"801_CR11","doi-asserted-by":"crossref","unstructured":"Hoang, C. T., McDiarmid, C.: On the divisibility of graphs. Discrete Mathematics 242, 145\u2013156 (2002)","DOI":"10.1016\/S0012-365X(01)00054-1"},{"key":"801_CR12","doi-asserted-by":"crossref","unstructured":"Kierstead, H.: On the chromatic index of multigraphs without large triangles. Journal of Combinatorial Theory, Series B 36, 156\u2013160 (1984)","DOI":"10.1016\/0095-8956(84)90022-4"},{"key":"801_CR13","doi-asserted-by":"crossref","unstructured":"Kim, J. H.: The Ramsey number R(3, t) has order of magnitude t 2\/log t. Random Structures and Algorithms 7, 173\u2013207 (1995)","DOI":"10.1002\/rsa.3240070302"},{"key":"801_CR14","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: A characterization of perfect graphs. Journal of Combinatorial Theory, Series B 13, 95\u201398 (1972)","DOI":"10.1016\/0095-8956(72)90045-7"},{"key":"801_CR15","doi-asserted-by":"crossref","unstructured":"Randerath, B., Schiermeyer, I.: Vertex colouring and forbidden subgraphs - A survey. Graphs and Combinatorics 20, 1\u201340 (2004)","DOI":"10.1007\/s00373-003-0540-1"},{"key":"801_CR16","unstructured":"West, D.B.: Introduction to Graph Theory, Second Edition, Prentice-Hall, Englewood Cliffs, New Jersey (2000)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0801-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0801-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0801-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:28Z","timestamp":1559055508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0801-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["801"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0801-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10]]}}}