{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T03:06:35Z","timestamp":1784603195197,"version":"3.55.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,1,13]],"date-time":"2015-01-13T00:00:00Z","timestamp":1421107200000},"content-version":"tdm","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":[[2015,11]]},"DOI":"10.1007\/s00373-014-1514-1","type":"journal-article","created":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T11:39:34Z","timestamp":1421062774000},"page":"2193-2200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Saturation Numbers for Linear Forests $$P_5 \\cup tP_2$$ P 5 \u222a t P 2"],"prefix":"10.1007","volume":"31","author":[{"given":"Qiong","family":"Fan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunxiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,1,13]]},"reference":[{"key":"1514_CR1","first-page":"258","volume":"247","author":"C Berge","year":"1958","unstructured":"Berge, C.: Sur le couplage maximum d\u2019un graphe. C. R. Acad. Sci. Paris 247, 258\u2013259 (1958)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"1514_CR2","first-page":"149","volume":"1","author":"T Bohman","year":"2010","unstructured":"Bohman, T., Fonoberova, M., Pikhurko, O.: The saturation function of complete partite graphs. J. Comb. 1, 149\u2013170 (2010)","journal-title":"J. Comb."},{"key":"1514_CR3","doi-asserted-by":"crossref","first-page":"178","DOI":"10.2307\/2315614","volume":"74","author":"B Bollob\u00e1s","year":"1967","unstructured":"Bollob\u00e1s, B.: On a conjecture of Erd\u0151s, Hajnal and Moon. Am. Math. Mon. 74, 178\u2013179 (1967)","journal-title":"Am. Math. Mon."},{"key":"1514_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applicaitons","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applicaitons. American Elsevier, New York (1976)"},{"key":"1514_CR5","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1017\/S0963548311000460","volume":"20","author":"N Bushaw","year":"2011","unstructured":"Bushaw, N., Kettle, N.: Tur\u00e1n of multiple of paths and equibipartite forests. Comb. Probab. Comput. 20, 837\u2013853 (2011)","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"1514_CR6","doi-asserted-by":"crossref","first-page":"118","DOI":"10.37236\/842","volume":"15","author":"G Chen","year":"2008","unstructured":"Chen, G., Faudree, R.J., Gould, R.J.: Saturation numbers of books. Electron. J. Comb. 15(1), 118\u2013129 (2008)","journal-title":"Electron. J. Comb."},{"key":"1514_CR7","unstructured":"Chen, G., Faudree J.R., Faudree R.J., Ronald J. Gould, R.J., Jacobson, M.S., Magnant, C.: Saturation number for linear forests (manuscript)"},{"issue":"2","key":"1514_CR8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1002\/jgt.20372","volume":"61","author":"Y Chen","year":"2009","unstructured":"Chen, Y.: Minimum $$C_5$$ C 5 -saturated graphs. J. Graph Theory 61(2), 111\u2013126 (2009)","journal-title":"J. Graph Theory"},{"issue":"1","key":"1514_CR9","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1002\/jgt.20508","volume":"67","author":"Y Chen","year":"2011","unstructured":"Chen, Y.: All minimum $$C_5$$ C 5 -saturated graphs. J. Graph Theory 67(1), 9\u201326 (2011)","journal-title":"J. Graph Theory"},{"key":"1514_CR10","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.2307\/2311408","volume":"71","author":"P Erd\u0151s","year":"1964","unstructured":"Erd\u0151s, P., Hajnal, A., Moon, J.W.: A problem in graph theory. Am. Math. Mon. 71, 1107\u20131110 (1964)","journal-title":"Am. Math. Mon."},{"issue":"1","key":"1514_CR11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.37236\/180","volume":"16","author":"JR Faudree","year":"2009","unstructured":"Faudree, J.R., Faudree, R.J., Gould, R.J., Jacobson, M.S.: Saturation numbers for trees. Electron. J. Comb. 16(1), 91\u2013109 (2009)","journal-title":"Electron. J. Comb."},{"key":"1514_CR12","doi-asserted-by":"crossref","unstructured":"Faudree, J.R., Faudree, R.J., Schmitt, J. R.: A survey of minimum saturation graphs. Electron. J. Comb. 18, #DS19 (2011)","DOI":"10.37236\/41"},{"issue":"19","key":"1514_CR13","doi-asserted-by":"crossref","first-page":"5870","DOI":"10.1016\/j.disc.2008.06.036","volume":"309","author":"JR Faudree","year":"2009","unstructured":"Faudree, J.R., Ferrara, M., Gould, R.J., Jacobson, M.S.: $$tK_p$$ t K p -saturated graphs of minimum size. Discret. Math. 309(19), 5870\u20135876 (2009)","journal-title":"Discret. Math."},{"key":"1514_CR14","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s00373-011-1128-9","volume":"29","author":"RJ Faudree","year":"2013","unstructured":"Faudree, R.J., Gould, R.J.: Saturation numbers for nearly complete graphs. Graphs Comb. 29, 429\u2013448 (2013)","journal-title":"Graphs Comb."},{"key":"1514_CR15","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/jgt.3190100209","volume":"10","author":"L K\u00e1szonyi","year":"1986","unstructured":"K\u00e1szonyi, L., Tuza, Z.: Saturated graphs with minimal number of edges. J. Graph Theory 10, 203\u2013210 (1986)","journal-title":"J. Graph Theory"},{"key":"1514_CR16","unstructured":"Ollmann, L.T.: $$K_{2,2}$$ K 2 , 2 -saturated graphs with a minimal number of edges. In: Proceedings of the Third Southeastern Conference on Combinatorics, Graph Theory, and Computing, pp. 367\u2013392. Florida Atlantic Univ., Boca Raton, Fla. (1972)"},{"key":"1514_CR17","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"},{"key":"1514_CR18","unstructured":"Tuza, Z.: $$C_4$$ C 4 -saturated graphs of minimum size. Acta Univ. Carolin. Math. Phys. 30(2), 161\u2013167. 17th Winter School on Abstract Analysis (Srn\u00ed, 1989)"},{"key":"1514_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, M., Luo, S., Shigeno, M.: On the number of edges in a minimum $$C_6$$ C 6 -saturated graph. Graphs Comb. doi: 10.1007\/s00373-014-1422-4","DOI":"10.1007\/s00373-014-1422-4"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1514-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1514-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1514-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,28]],"date-time":"2020-08-28T21:54:00Z","timestamp":1598651640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1514-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,13]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["1514"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1514-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,13]]}}}