{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T05:06:06Z","timestamp":1768712766126,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,4,24]],"date-time":"2014-04-24T00:00:00Z","timestamp":1398297600000},"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,7]]},"DOI":"10.1007\/s00373-014-1422-4","type":"journal-article","created":{"date-parts":[[2014,4,23]],"date-time":"2014-04-23T08:54:02Z","timestamp":1398243242000},"page":"1085-1106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["On the Number of Edges in a Minimum $$C_6$$ C 6 -Saturated Graph"],"prefix":"10.1007","volume":"31","author":[{"given":"Mingchao","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Song","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maiko","family":"Shigeno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,24]]},"reference":[{"key":"1422_CR1","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0012-365X(95)00173-T","volume":"150","author":"CA Barefoot","year":"1996","unstructured":"Barefoot, C.A., Clark, L.H., Entringer, R.C., Porter, T.D., Sz\u00e9kely, L.A., Tuza, Z.: Cycle-saturated graphs of minimum size. Discret. Math. 150, 31\u201348 (1996)","journal-title":"Discret. Math."},{"key":"1422_CR2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4153\/CMB-1972-012-3","volume":"15","author":"JA Bondy","year":"1972","unstructured":"Bondy, J.A.: Variations on the Hamiltonian theme. Can. Math. Bull. 15, 57\u201362 (1972)","journal-title":"Can. Math. Bull."},{"key":"1422_CR3","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, 111\u2013126 (2009)","journal-title":"J. Graph Theory"},{"key":"1422_CR4","unstructured":"Chen, Y.: Minimum $$K_{2,3}$$ K 2 , 3 -saturated graphs. arXiv:1012.4152 (2010)"},{"key":"1422_CR5","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1002\/jgt.20508","volume":"67","author":"Y Chen","year":"2011","unstructured":"Chen, Y.: All minimum C5-saturated graphs. J. Graph Theory 67, 9\u201326 (2011)","journal-title":"J. Graph Theory"},{"key":"1422_CR6","first-page":"215","volume":"53","author":"LH Clark","year":"1986","unstructured":"Clark, L.H., Crane, R.P., Entringer, R.C., Shapiro, H.D.: On smallest maximally nonhamiltonian graphs. Congr. Numer. 53, 215\u2013220 (1986)","journal-title":"Congr. Numer."},{"key":"1422_CR7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02023582","volume":"15","author":"LH Clark","year":"1983","unstructured":"Clark, L.H., Entringer, R.C.: Smallest maximally nonhamiltonian graphs. Period. Math. Hung. 15, 57\u201368 (1983)","journal-title":"Period. Math. Hung."},{"key":"1422_CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF02349959","volume":"8","author":"LH Clark","year":"1992","unstructured":"Clark, L.H., Entringer, R.C., Shapiro, H.D.: Smallest maximally nonhamiltonian graphs II. Graphs Comb. 8, 225\u2013231 (1992)","journal-title":"Graphs Comb."},{"issue":"2","key":"1422_CR9","doi-asserted-by":"crossref","first-page":"197","DOI":"10.7151\/dmgt.1225","volume":"24","author":"A Dudek","year":"2004","unstructured":"Dudek, A., Wojda, A.P.: $$P_m$$ P m -saturated bipartite graphs with minimum size. Discuss. Math. Graph Theory 24(2), 197\u2013211 (2004)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1422_CR10","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S1571-0653(04)00434-2","volume":"13","author":"A Dudek","year":"2003","unstructured":"Dudek, A., Katona, G.Y., Wojda, A.P.: $$m$$ m -path cover saturated graphs. Electron. Notes Discret. Math. 13, 41\u201344 (2003)","journal-title":"Electron. Notes Discret. Math."},{"key":"1422_CR11","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.2307\/2311408","volume":"71","author":"P Erd\u00f6s","year":"1964","unstructured":"Erd\u00f6s, P., Hajnal, A., Moon, J.W.: A problem in graph theory. Am. Math. Mon. 71, 1107\u20131110 (1964)","journal-title":"Am. Math. Mon."},{"key":"1422_CR12","doi-asserted-by":"crossref","first-page":"R32","DOI":"10.37236\/1929","volume":"12","author":"M Frick","year":"2005","unstructured":"Frick, M., Singleton, J.: Lower bound for the size of maximal nontraceable graphs. Electron. J. Comb. 12, R32 (2005)","journal-title":"Electron. J. Comb."},{"key":"1422_CR13","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/j.endm.2011.09.082","volume":"38","author":"Z F\u00fcredi","year":"2011","unstructured":"F\u00fcredi, Z., Kim, Y.: Minimum $$C_k$$ C k -saturated graphs. Electron. Notes Discret. Math. 38, 505\u2013510 (2011)","journal-title":"Electron. Notes Discret. Math."},{"key":"1422_CR14","doi-asserted-by":"crossref","unstructured":"Faudree, J.R., Faudree, R.J., Schmitt, J.R.: A survey of minimum saturated graphs. Electron. J. Comb. 18, DS19 (2011)","DOI":"10.37236\/41"},{"key":"1422_CR15","doi-asserted-by":"crossref","unstructured":"Gould, R., \u0141uczak, T., Schmitt, J.: Constructive upper bounds for cycle-saturated graphs of minimum size. Electron. J. Comb. 13, R29 (2006)","DOI":"10.37236\/1055"},{"issue":"2","key":"1422_CR16","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(2), 203\u2013210 (1986)","journal-title":"J. Graph Theory"},{"key":"1422_CR17","first-page":"263","volume":"45","author":"X Lin","year":"1997","unstructured":"Lin, X., Jiang, W., Zhang, C., Yang, Y.: On smallest maximally nonhamiltonian graphs. Ars Comb. 45, 263\u2013270 (1997)","journal-title":"Ars Comb."},{"key":"1422_CR18","unstructured":"Ollmann, L.T.: $$K_{2,2}$$ K 2 , 2 -saturated graphs with a minimal number of edges. In: Proceedings of 3rd Southeast Conference on Combinatorics, Graph Theory and Computing, pp. 367\u2013392 (1972)"},{"key":"1422_CR19","first-page":"161","volume":"30","author":"Z Tuza","year":"1989","unstructured":"Tuza, Z.: $$C_4$$ C 4 -saturated graphs of minimum size. Acta Univ. Math. Phys. 30, 161\u2013167 (1989)","journal-title":"Acta Univ. Math. Phys."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1422-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1422-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1422-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,18]],"date-time":"2020-08-18T07:13:52Z","timestamp":1597734832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1422-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,24]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["1422"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1422-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,24]]}}}