{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:21Z","timestamp":1725558801346},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140303"},{"type":"electronic","value":"9783642140310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14031-0_24","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T09:50:06Z","timestamp":1277718606000},"page":"209-215","source":"Crossref","is-referenced-by-count":1,"title":["The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs"],"prefix":"10.1007","author":[{"given":"I W.","family":"Sudarsana","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Adiwijaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Musdalifah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_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. Combin. Math. Combin. Comput.\u00a071, 173\u2013177 (2009)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"3297","DOI":"10.1016\/j.disc.2006.06.011","volume":"306","author":"E.T. Baskoro","year":"2006","unstructured":"Baskoro, E.T., Hasmawati, Assiyatun, H.: The Ramsey number for disjoint unions of trees. Discrete Math.\u00a0306, 3297\u20133301 (2006)","journal-title":"Discrete Math."},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.aml.2008.06.018","volume":"22","author":"H. Bielak","year":"2009","unstructured":"Bielak, H.: Ramsey numbers for a disjoint of some graphs. Appl. Math. Lett.\u00a022, 475\u2013477 (2009)","journal-title":"Appl. Math. Lett."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0095-8956(71)90016-5","volume":"11","author":"J.A. Bondy","year":"1971","unstructured":"Bondy, J.A.: Pancyclic graph. J. Combin. Theory Ser. B\u00a011, 80\u201384 (1971)","journal-title":"J. Combin. Theory Ser. B"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1002\/jgt.3190010118","volume":"1","author":"V. Chv\u00e1tal","year":"1977","unstructured":"Chv\u00e1tal, V.: Tree complete graphs Ramsey number. J. Graph Theory\u00a01, 93 (1977)","journal-title":"J. Graph Theory"},{"key":"24_CR6","first-page":"21","volume":"17","author":"S.A. Burr","year":"1984","unstructured":"Burr, S.A.: Determining generalized Ramsey numbers is NP-hard. Ars Combin.\u00a017, 21\u201325 (1984)","journal-title":"Ars Combin."},{"key":"24_CR7","first-page":"167","volume":"10","author":"L. Gerencser","year":"1967","unstructured":"Gerencser, L., Gyarfas, A.: On Ramsey-Type problems, Annales Universitatis Scientiarum Budapestinensis. Eotvos Sect. Math.\u00a010, 167\u2013170 (1967)","journal-title":"Eotvos Sect. Math."},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"2046","DOI":"10.1016\/j.disc.2007.04.026","volume":"308","author":"Hasmawati","year":"2008","unstructured":"Hasmawati, Baskoro, E.T., Assiyatun, H.: The Ramsey number for disjoint unions of graphs. Discrete Math.\u00a0308, 2046\u20132049 (2008)","journal-title":"Discrete Math."},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-89550-3_9","volume-title":"Computational Geometry and Graph Theory","author":"Hasmawati","year":"2008","unstructured":"Hasmawati, Assiyatun, H., Baskoro, E.T., Salman, A.N.M.: Ramsey numbers on a union of identical stars versus a small cycle. In: Ito, H., Kano, M., Katoh, N., Uno, Y. (eds.) KyotoCGGT 2007. LNCS, vol.\u00a04535, pp. 85\u201389. Springer, Heidelberg (2008)"},{"key":"24_CR10","first-page":"12","volume":"DS1","author":"S.P. Radziszowski","year":"2009","unstructured":"Radziszowski, S.P.: Small Ramsey numbers. Electronic J. Combin.\u00a0DS1 12 (August 4, 2009), \n                    \n                      http:\/\/www.combinatorics.org","journal-title":"Electronic J. Combin."},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1006\/jcss.2000.1729","volume":"62","author":"M. Schaefer","year":"2001","unstructured":"Schaefer, M.: Graph Ramsey theory and the polynomial hierarchy. J. Comput. Sys. Sci.\u00a062, 290\u2013322 (2001)","journal-title":"J. Comput. Sys. Sci."},{"key":"24_CR12","first-page":"257","volume":"71","author":"I.W. Sudarsana","year":"2009","unstructured":"Sudarsana, I.W., Baskoro, E.T., Assiyatun, H., Uttunggadewa, S.: On the Ramsey numbers of certain forest respect to small wheels. J. Combin. Math. Combin. Comput.\u00a071, 257\u2013264 (2009)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"24_CR13","unstructured":"Sudarsana, I.W., Baskoro, E.T., Assiyatun, H., Uttunggadewa, S., Yulianti, L.: The Ramsey number for the union of graphs containing at least one H-good component (Under revision for publication in Utilitas Math.)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14031-0_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:16:27Z","timestamp":1619784987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14031-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140303","9783642140310"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14031-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}