{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:46:29Z","timestamp":1648885589808},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,6,6]],"date-time":"2016-06-06T00:00:00Z","timestamp":1465171200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s00373-016-1721-z","type":"journal-article","created":{"date-parts":[[2016,6,6]],"date-time":"2016-06-06T01:27:37Z","timestamp":1465176457000},"page":"2541-2549","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Ramsey-Goodness of Paths"],"prefix":"10.1007","volume":"32","author":[{"given":"Binlong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Halina","family":"Bielak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,6]]},"reference":[{"key":"1721_CR1","first-page":"173","volume":"71","author":"K Ali","year":"2009","unstructured":"Ali, K., Baig, A.Q., Baskoro, E.T.: On the Ramsey number for a linear forest versus a cocktail party graph. J. Comb. Math. Comb. Comput. 71, 173\u2013177 (2009)","journal-title":"J. Comb. Math. Comb. Comput."},{"issue":"3","key":"1721_CR2","first-page":"177","volume":"51","author":"K Ali","year":"2008","unstructured":"Ali, K., Baskoro, E.T., Tomescu, I.: On the Ramsey numbers for paths and generalized Jahangir graphs $$J_{s, m}$$ J s , m . Bull. Math. Soc. Sci. Math. Roumanie Tome 51(3), 177\u2013182 (2008)","journal-title":"Bull. Math. Soc. Sci. Math. Roumanie Tome"},{"key":"1721_CR3","first-page":"133","volume":"5","author":"K Ali","year":"2009","unstructured":"Ali, K., Baskoro, E.T., Tomescu, I.: On the Ramsey number for paths and beaded wheels. J. Prime Res. Math. 5, 133\u2013138 (2009)","journal-title":"J. Prime Res. Math."},{"issue":"4","key":"1721_CR4","first-page":"385","volume":"17","author":"K Ali","year":"2015","unstructured":"Ali, K., Tomescu, I., Javaid, I.: On path-sunflower Ramsey numbers. Math. Rep. 17(4), 385\u2013390 (2015)","journal-title":"Math. Rep."},{"key":"1721_CR5","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1112\/jlms\/s2-24.3.405","volume":"24","author":"SA Burr","year":"1981","unstructured":"Burr, S.A.: Ramsey numbers involving graphs with long suspended paths. J. Lond. Math. Soc. 24, 405\u2013413 (1981)","journal-title":"J. Lond. Math. Soc."},{"issue":"1","key":"1721_CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.disc.2004.10.017","volume":"290","author":"Y Chen","year":"2005","unstructured":"Chen, Y., Zhang, Y., Zhang, K.: The Ramsey numbers of paths versus wheels. Discret. Math. 290(1), 85\u201387 (2005)","journal-title":"Discret. Math."},{"key":"1721_CR7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"GA Dirac","year":"1952","unstructured":"Dirac, G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 69\u201381 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"2","key":"1721_CR8","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0012-365X(76)90142-4","volume":"16","author":"RJ Faudree","year":"1976","unstructured":"Faudree, R.J., Schelp, R.H.: Ramsey numbers for all linear forests. Discret. Math. 16(2), 149\u2013155 (1976)","journal-title":"Discret. Math."},{"issue":"2","key":"1721_CR9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0012-365X(74)90122-8","volume":"10","author":"RJ Faudree","year":"1974","unstructured":"Faudree, R.J., Lawrence, S.L., Parsons, T.D., Schelp, R.H.: Path-cycle Ramsey numbers. Discret. Math. 10(2), 269\u2013277 (1974)","journal-title":"Discret. Math."},{"key":"1721_CR10","first-page":"167","volume":"10","author":"L Gerencs\u00e9r","year":"1967","unstructured":"Gerencs\u00e9r, L., Gy\u00e1rf\u00e1s, A.: On Ramsey-type problems. Ann. Univ. Sci. Budapest E\u00f6tv\u00f6s Sec. Math. 10, 167\u2013170 (1967)","journal-title":"Ann. Univ. Sci. Budapest E\u00f6tv\u00f6s Sec. Math."},{"issue":"5","key":"1721_CR11","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1016\/j.ejc.2009.10.011","volume":"31","author":"Q Lin","year":"2010","unstructured":"Lin, Q., Li, Y., Dong, L.: Ramsey goodness and generalized stars. Eur. J. Comb. 31(5), 1228\u20131234 (2010)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"1721_CR12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0095-8956(74)90048-3","volume":"17","author":"TD Parsons","year":"1974","unstructured":"Parsons, T.D.: Path-star Ramsey numbers. J. Combin. Theory Ser. B 17(1), 51\u201358 (1974)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1721_CR13","unstructured":"Pokrovskiy, A.: Calculating Ramsey numbers by partitioning coloured graphs, eprint arXiv:1309.3952"},{"key":"1721_CR14","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1112\/jlms\/s2-18.3.392","volume":"18","author":"CC Rousseau","year":"1978","unstructured":"Rousseau, C.C., Sheehan, J.: A class of Ramsey problems involving trees. J. Lond. Math. Soc. 18, 392\u2013396 (1978)","journal-title":"J. Lond. Math. Soc."},{"issue":"9","key":"1721_CR15","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1016\/j.dam.2005.05.040","volume":"154","author":"ANM Salman","year":"2006","unstructured":"Salman, A.N.M., Broersma, H.J.: Path-fan Ramsey numbers. Discret. Appl. Math. 154(9), 1429\u20131436 (2006)","journal-title":"Discret. Appl. Math."},{"issue":"14","key":"1721_CR16","doi-asserted-by":"crossref","first-page":"1878","DOI":"10.1016\/j.dam.2006.05.013","volume":"155","author":"ANM Salman","year":"2007","unstructured":"Salman, A.N.M., Broersma, H.J.: Path-kipas Ramsey numbers. Discret. Appl. Math. 155(14), 1878\u20131884 (2007)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"1721_CR17","doi-asserted-by":"crossref","first-page":"31","DOI":"10.22342\/jims.20.1.179.31-35","volume":"20","author":"IW Sudarsana","year":"2014","unstructured":"Sudarsana, I.W.: The goodness of long path with respect to multiple copies of complete graphs. J. Indones. Math. Soc. 20(1), 31\u201335 (2014)","journal-title":"J. Indones. Math. Soc."},{"key":"1721_CR18","doi-asserted-by":"crossref","unstructured":"Sudarsana, I.W., Assiyatun, H., Adiwijaya, Musdalifah, S.: The Ramsey number for a linear forest versus two identical copies of complete graphs. Discret. Math. Alg. Appl. 2(4), 437\u2013444 (2010)","DOI":"10.1142\/S1793830910000784"},{"key":"1721_CR19","doi-asserted-by":"crossref","unstructured":"Surahmat, Tomescu, I.: On path-Jahangir Ramsey numbers. Appl. Math. Sci. 8(99), 4899\u20134904 (2014)","DOI":"10.12988\/ams.2014.46421"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1721-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-016-1721-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1721-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T11:46:58Z","timestamp":1498304818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-016-1721-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,6]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["1721"],"URL":"https:\/\/doi.org\/10.1007\/s00373-016-1721-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,6]]}}}