{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T02:33:23Z","timestamp":1776911603092,"version":"3.51.2"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,12,30]],"date-time":"2017-12-30T00:00:00Z","timestamp":1514592000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s00373-017-1870-8","type":"journal-article","created":{"date-parts":[[2017,12,30]],"date-time":"2017-12-30T09:47:32Z","timestamp":1514627252000},"page":"97-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Colouring of $$(P_3 \\cup P_2)$$(P3\u222aP2)-free graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Arpitha P.","family":"Bharathi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheshayya A.","family":"Choudum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,30]]},"reference":[{"key":"1870_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0012-365X(01)00268-0","volume":"250","author":"C Arbib","year":"2002","unstructured":"Arbib, C., Mosca, R.: On ($$P_5$$P5, diamond)-free graphs. Discrete Math. 250, 1\u201322 (2002)","journal-title":"Discrete Math."},{"key":"1870_CR2","unstructured":"Bermond, J.C., Bond, J., Paoli, M., Peyrat, C.: Surveys in Combinatorics. Proceedings of the Ninth British Combinatorics Conference, Lecture Notes Series, vol. 82 (1983)"},{"key":"1870_CR3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0012-365X(93)90477-B","volume":"115","author":"Z Bl\u00e1zsik","year":"1993","unstructured":"Bl\u00e1zsik, Z., Hujter, M., Pluh\u00e1r, A., Tuza, Z.: Graphs with no induced $$C_4$$C4 and $$2K_2$$2K2. Discrete Math. 115, 51\u201355 (1993)","journal-title":"Discrete Math."},{"key":"1870_CR4","volume-title":"Graph Theory. Graduate Texts in Mathematics","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics. Springer, Berlin (2008)"},{"key":"1870_CR5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0166-218X(03)00266-X","volume":"138","author":"A Brandst\u00e4dt","year":"2004","unstructured":"Brandst\u00e4dt, A.: ($$P_{5}$$P5, diamond)-free graphs revisited: structure and linear time optimization. Discrete Appl. Math. 138, 13\u201327 (2004)","journal-title":"Discrete Appl. Math."},{"key":"1870_CR6","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. Society for Industrial and Applied Mathematics (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"1870_CR7","doi-asserted-by":"crossref","first-page":"3398","DOI":"10.1016\/j.disc.2010.08.005","volume":"310","author":"SA Choudum","year":"2010","unstructured":"Choudum, S.A., Karthick, T.: First fit coloring of $$\\{P_5, K_4-e\\}$${P5,K4-e}-free graphs. Discrete Appl. Math. 310, 3398\u20133403 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"1870_CR8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Seymour, P., Robertson, N., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164(1), 51\u2013229 (2006)","journal-title":"Ann. Math."},{"key":"1870_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(90)90144-7","volume":"81","author":"FRK Chung","year":"1990","unstructured":"Chung, F.R.K., Gy\u00e1rf\u00e1s, A., Tuza, Z., Trotter, W.T.: The maximum number of edges in $$2K_2$$2K2-free graphs of bounded degree. Discrete Math. 81, 129\u2013135 (1990)","journal-title":"Discrete Math."},{"key":"1870_CR10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02579243","volume":"5","author":"M El-Zahar","year":"1985","unstructured":"El-Zahar, M., Erd\u0151s, P.: On the existence of two non-neighboring subgraphs in a graph. Combinatorica 5, 295\u2013300 (1985)","journal-title":"Combinatorica"},{"key":"1870_CR11","unstructured":"Erd\u0151s, P.: Problems and results on chromatic numbers in finite and infinite graphs. Graph Theory with Applications to Algorithms and Computer Science. Kalamazoo, Michigan, 1984, pp. 201\u2013213. Wiley, New York (1985)"},{"issue":"3\u20134","key":"1870_CR12","first-page":"413","volume":"19","author":"A Gy\u00e1rf\u00e1s","year":"1987","unstructured":"Gy\u00e1rf\u00e1s, A.: Problems from the world surrounding perfect graphs. Zastosowania Matematyki 19(3\u20134), 413\u2013441 (1987)","journal-title":"Zastosowania Matematyki"},{"key":"1870_CR13","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032497","volume-title":"Graph Coloring Problems","author":"TR Jensen","year":"1994","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley, New York (1994)"},{"key":"1870_CR14","doi-asserted-by":"crossref","first-page":"1447","DOI":"10.1007\/s00373-015-1651-1","volume":"32","author":"T Karthick","year":"2016","unstructured":"Karthick, T., Maffray, F.: Vizing bound for the chromatic number on some graph classes. Graphs Comb. 32, 1447\u20131460 (2016)","journal-title":"Graphs Comb."},{"key":"1870_CR15","doi-asserted-by":"crossref","unstructured":"Kr\u00e1l\u2019, D., Kratochv\u00edl, J., Tuza, Zs., Woeginger G.J.: Complexity of colouring graphs without forbidden induced subgraphs. In: Proceedings of WG 2001, LNCS, vol. 224, pp. 254\u2013262. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45477-2_23"},{"key":"1870_CR16","unstructured":"Nagy, Zs., Szentmikl\u00f3ssy, Z.: A $20 open problem of Erd\u0151s to show that if $$G$$G is $$2K_{2}$$2K2-free graph with clique number 3, then its chromatic number is 4 (unpublished)"},{"key":"1870_CR17","doi-asserted-by":"crossref","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\u2014a survey. Graphs Comb. 20, 1\u201340 (2004)","journal-title":"Graphs Comb."},{"key":"1870_CR18","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0095-8956(74)90063-X","volume":"16","author":"D Seinsche","year":"1974","unstructured":"Seinsche, D.: On a property of the class of $$n$$n-colorable graphs. J. Comb. Theory Ser. B 16, 191\u2013193 (1974)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"1870_CR19","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0095-8956(80)90093-3","volume":"29","author":"S Wagon","year":"1980","unstructured":"Wagon, S.: A bound on the chromatic number of graphs without certain induced subgraphs. J. Comb. Theory Ser. B 29(3), 345\u2013346 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1870_CR20","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2000","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2000)","edition":"2"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1870-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1870-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1870-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T17:49:46Z","timestamp":1570556986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1870-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,30]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["1870"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1870-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,30]]}}}