{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T10:03:30Z","timestamp":1766311410207},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,12,9]],"date-time":"2016-12-09T00:00:00Z","timestamp":1481241600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Research Grand \u201cProgram Hibah Riset Ung- gulan ITB-DIKTI\u201d, Ministry of Research, Technology and Higher Education, Indonesia."}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s00373-016-1748-1","type":"journal-article","created":{"date-parts":[[2016,12,9]],"date-time":"2016-12-09T11:26:15Z","timestamp":1481282775000},"page":"233-243","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On Ramsey $$(mK_2,H)$$ ( m K 2 , H ) -Minimal Graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Kristiana","family":"Wijaya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edy Tri","family":"Baskoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hilda","family":"Assiyatun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Djoko","family":"Suprijanto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,9]]},"reference":[{"issue":"4","key":"1748_CR1","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s003730200056","volume":"18","author":"ET Baskoro","year":"2002","unstructured":"Baskoro, E.T., Nababan, S.M., Miller, M.: On Ramsey numbers for trees versus wheels of five or six vertices. Graphs Comb. 18(4), 717\u2013721 (2002)","journal-title":"Graphs Comb."},{"key":"1748_CR2","unstructured":"Baskoro, E.T., Vetr\u00edk, T., Yulianti, L.: A note on Ramsey $$(K_{1,2},C_4)$$ ( K 1 , 2 , C 4 ) -minimal graphs of diameter 2. In: Proceedings of the International Conference 70 Years of FCE STU, pp. 1\u20134. Bratislava, Slovakia (2008)"},{"key":"1748_CR3","doi-asserted-by":"crossref","unstructured":"Baskoro, E.T., Wijaya, K.: On Ramsey $$(2K_2,K_4)$$ ( 2 K 2 , K 4 ) -minimal graphs. In: Mathematics in the 21st Century, Springer Proceedings in Mathematics & Statistics, vol. 98, pp. 11\u201317 (2015)","DOI":"10.1007\/978-3-0348-0859-0_2"},{"issue":"2","key":"1748_CR4","first-page":"83","volume":"8","author":"ET Baskoro","year":"2011","unstructured":"Baskoro, E.T., Yulianti, L.: On Ramsey minimal graphs for $$2K_2$$ 2 K 2 versus $$P_n$$ P n . Adv. Appl. Discrete Math. 8(2), 83\u201390 (2011)","journal-title":"Adv. Appl. Discrete Math."},{"key":"1748_CR5","first-page":"79","volume":"65","author":"ET Baskoro","year":"2008","unstructured":"Baskoro, E.T., Yulianti, L., Assiyatun, H.: Ramsey $$(K_{1,2}, C_4)$$ ( K 1 , 2 , C 4 ) -minimal graphs. J. Combin. Math. Combin. Comput. 65, 79\u201390 (2008)","journal-title":"J. Combin. Math. Combin. Comput."},{"issue":"1\u20132","key":"1748_CR6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.disc.2003.11.043","volume":"286","author":"M Borowiecki","year":"2004","unstructured":"Borowiecki, M., Ha\u0142uszczak, M., Sidorowicz, E.: On Ramsey minimal graphs. Discrete Math. 286(1\u20132), 37\u201343 (2004)","journal-title":"Discrete Math."},{"key":"1748_CR7","doi-asserted-by":"crossref","first-page":"R20","DOI":"10.37236\/1917","volume":"12","author":"M Borowiecki","year":"2005","unstructured":"Borowiecki, M., Schiermeyer, I., Sidorowicz, E.: Ramsey $$(K_{1,2}, K_3)$$ ( K 1 , 2 , K 3 ) -minimal graphs. Electron. J. Combin. 12, R20 (2005)","journal-title":"Electron. J. Combin."},{"issue":"19","key":"1748_CR8","doi-asserted-by":"crossref","first-page":"1843","DOI":"10.1016\/j.disc.2012.06.020","volume":"313","author":"M Borowiecka-Olszewska","year":"2012","unstructured":"Borowiecka-Olszewska, M., Ha\u0142uszczak, M.: On Ramsey $$(K_{1, m},\\cal{G})$$ ( K 1 , m , G ) -minimal graphs. Discrete Math. 313(19), 1843\u20131855 (2012)","journal-title":"Discrete Math."},{"key":"1748_CR9","volume-title":"Generalized Ramsey Theory for Graphs\u2013A Survey","author":"SA Burr","year":"1973","unstructured":"Burr, S.A.: Generalized Ramsey Theory for Graphs\u2013A Survey. Graphs and Combinatorics. Springer, Berlin (1973)"},{"key":"1748_CR10","unstructured":"Burr, S.A., Erd\u00f6s, P., Faudree, R.J., Schelp, R.H.: A class of Ramsey-finite graphs. In: Proceeding of the Ninth Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. 171\u2013180. Boca Raton (1978)"},{"key":"1748_CR11","unstructured":"Burr, S.A., Erd\u00f6s, P., Faudree, R.J., Schelp, R.H.: Ramsey minimal graphs for matchings. In: The Theory and Applications of Graphs (Kalamazoo, Mich.) (1980), pp. 159\u2013168. Wiley, New York (1981)"},{"issue":"1","key":"1748_CR12","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0012-365X(82)90165-0","volume":"38","author":"SA Burr","year":"1982","unstructured":"Burr, S.A., Erd\u00f6s, P., Faudree, R.J., Rousseau, C.C., Schelp, R.H.: Ramsey minimal graphs for forests. Discrete Math. 38(1), 23\u201332 (1982)","journal-title":"Discrete Math."},{"key":"1748_CR13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/1097-0118(200010)35:2<99::AID-JGT4>3.0.CO;2-6","volume":"35","author":"CJ Jayawardene","year":"2000","unstructured":"Jayawardene, C.J., Rousseau, C.C.: The Ramsey number for a cycle of length five vs. a complete graph of order six. J. Graph Theory 35, 99\u2013108 (2000)","journal-title":"J. Graph Theory"},{"key":"1748_CR14","doi-asserted-by":"crossref","first-page":"R4","DOI":"10.37236\/1184","volume":"1","author":"T \u0141uczak","year":"1994","unstructured":"\u0141uczak, T.: On Ramsey minimal graphs. Electron. J. Combin. 1, R4 (1994)","journal-title":"Electron. J. Combin."},{"key":"1748_CR15","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/S0166-218X(99)00089-X","volume":"95","author":"I Mengersen","year":"1999","unstructured":"Mengersen, I., Oeckermann, J.: Matching-star Ramsey sets. Discrete Appl. Math. 95, 417\u2013424 (1999)","journal-title":"Discrete Appl. Math."},{"key":"1748_CR16","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1063\/1.4724125","volume":"1450","author":"H Muhshi","year":"2012","unstructured":"Muhshi, H., Baskoro, E.T.: On Ramsey $$(3K_2, P_3)$$ ( 3 K 2 , P 3 ) -minimal graphs. AIP Conference Proceeding 1450, 110\u2013117 (2012)","journal-title":"AIP Conference Proceeding"},{"key":"1748_CR17","unstructured":"Surahmat, Baskoro, E.T., Broersma, H.J.: The Ramsey numbers of large cycles versus small wheels. INTEGERS Electron. J. Combin. Number Theory 4(A#10), 1\u20139 (2004)"},{"key":"1748_CR18","doi-asserted-by":"crossref","first-page":"637","DOI":"10.7151\/dmgt.1519","volume":"30","author":"T Vetr\u00edk","year":"2010","unstructured":"Vetr\u00edk, T., Yulianti, L., Baskoro, E.T.: On Ramsey $$(K_{1,2}, C_4)$$ ( K 1 , 2 , C 4 ) -minimal graphs. Discuss. Math. Graph Theory 30, 637\u2013649 (2010)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"2","key":"1748_CR19","doi-asserted-by":"crossref","first-page":"216","DOI":"10.5614\/ejgta.2015.3.2.9","volume":"3","author":"K Wijaya","year":"2015","unstructured":"Wijaya, K., Baskoro, E.T., Assiyatun, H., Suprijanto, D.: The complete list of Ramsey $$(2K_2, K_4)$$ ( 2 K 2 , K 4 ) -minimal graphs. Electron. J. Graph Theory Appl. 3(2), 216\u2013227 (2015)","journal-title":"Electron. J. Graph Theory Appl."},{"key":"1748_CR20","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.procs.2015.12.067","volume":"74","author":"K Wijaya","year":"2015","unstructured":"Wijaya, K., Baskoro, E.T., Assiyatun, H., Suprijanto, D.: On unicyclic Ramsey $$(mK_2, P_3)$$ ( m K 2 , P 3 ) -minimal graphs. Proc. Comput. Sci. 74, 10\u201314 (2015)","journal-title":"Proc. Comput. Sci."},{"key":"1748_CR21","doi-asserted-by":"publisher","unstructured":"Wijaya, K., Baskoro, E.T., Assiyatun, H., Suprijanto, D.: On Ramsey $$(3K_2,K_3)$$ ( 3 K 2 , K 3 ) -minimal graphs. In: AIP Conference Proceedings, vol. 1707, pp. 020025 (2016). doi: 10.1063\/1.4940826","DOI":"10.1063\/1.4940826"},{"key":"1748_CR22","first-page":"9","volume":"46","author":"K Wijaya","year":"2015","unstructured":"Wijaya, K., Yulianti, L., Baskoro, E.T., Assiyatun, H., Suprijanto, D.: All Ramsey $$(2K_2, C_4)$$ ( 2 K 2 , C 4 ) -minimal graphs. J. Algorithms Comput. 46, 9\u201325 (2015)","journal-title":"J. Algorithms Comput."},{"issue":"1","key":"1748_CR23","first-page":"23","volume":"40","author":"L Yulianti","year":"2010","unstructured":"Yulianti, L., Assiyatun, H., Uttunggadewa, S., Baskoro, E.T.: On Ramsey $$(K_{1,2}, P_4)$$ ( K 1 , 2 , P 4 ) -minimal graphs. Far East J. Math. Sci. 40(1), 23\u201336 (2010)","journal-title":"Far East J. Math. Sci."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1748-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-016-1748-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1748-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,27]],"date-time":"2020-09-27T21:17:00Z","timestamp":1601241420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-016-1748-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,9]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["1748"],"URL":"https:\/\/doi.org\/10.1007\/s00373-016-1748-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,9]]}}}