{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T07:44:44Z","timestamp":1770882284459,"version":"3.50.1"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,1,11]],"date-time":"2012-01-11T00:00:00Z","timestamp":1326240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s00373-011-1128-9","type":"journal-article","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T11:04:03Z","timestamp":1326193443000},"page":"429-448","source":"Crossref","is-referenced-by-count":12,"title":["Saturation Numbers for Nearly Complete Graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Ralph J.","family":"Faudree","sequence":"first","affiliation":[]},{"given":"Ronald J.","family":"Gould","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,1,11]]},"reference":[{"key":"1128_CR1","volume-title":"Graphs and Digraphs","author":"G. Chartrand","year":"2005","unstructured":"Chartrand G., Lesniak L.: Graphs and Digraphs. Chapman and Hall, London (2005)"},{"key":"1128_CR2","doi-asserted-by":"crossref","unstructured":"Chen, G., Guantao, Faudree, R.J., Gould, R.J.: Saturation numbers of books. Electron. J. Combin. 15 (2008)","DOI":"10.37236\/842"},{"key":"1128_CR3","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. Monthly 71, 1107\u20131110 (1964)","journal-title":"Am. Math. Monthly"},{"key":"1128_CR4","doi-asserted-by":"crossref","unstructured":"Faudree, J.R., Faudree, R.J., Gould, R.J., Jacobson, M.S.: Saturation numbers for trees. Electron. J. Combin. 16 (2009)","DOI":"10.37236\/180"},{"key":"1128_CR5","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"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1128-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1128-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1128-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T15:01:21Z","timestamp":1593529281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1128-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,11]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["1128"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1128-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,11]]}}}