{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T04:12:27Z","timestamp":1773720747905,"version":"3.50.1"},"reference-count":6,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":7429,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1986,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Let F = {<jats:italic>F<\/jats:italic><jats:sub>1<\/jats:sub>,\u2026} be a given class of forbidden graphs. A graph <jats:italic>G<\/jats:italic> is called F\u2010saturated if no <jats:italic>F<\/jats:italic><jats:sub><jats:italic>i<\/jats:italic><\/jats:sub> \u2208 F is a subgraph of <jats:italic>G<\/jats:italic> but the addition of an arbitrary new edge gives a forbidden subgraph. In this paper the minimal number of edges in F\u2010saturated graphs is examined. General estimations are given and the structure of minimal graphs is described for some special forbidden graphs (stars, paths, <jats:italic>m<\/jats:italic> pairwise disjoint edges).<\/jats:p>","DOI":"10.1002\/jgt.3190100209","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T11:55:44Z","timestamp":1180180544000},"page":"203-210","source":"Crossref","is-referenced-by-count":104,"title":["Saturated graphs with minimal number of edges"],"prefix":"10.1002","volume":"10","author":[{"given":"L.","family":"K\u00e1szonyi","sequence":"first","affiliation":[]},{"given":"Zs.","family":"Tuza","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01904851"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.2307\/2315614"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.2307\/2311408"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01428195"},{"key":"e_1_2_1_6_2","unstructured":"L. T.Ollman K2 2\u2010saturated graphs with a minimal number of edges Proc. 3rd S\u2010E Conference on Combinatorics Graph Theory and Computing 367\u2013392."},{"key":"e_1_2_1_7_2","first-page":"253","article-title":"\u00dcber eine Klasse paarer Graphen, Beweis einer Vermutung von Erd\u00f6s, Hajnal and Moon","volume":"12","author":"Wessel W.","year":"1966","journal-title":"Wiss. Z. Techn. Hochsch. Ilmenau"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190100209","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190100209","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T22:53:31Z","timestamp":1697928811000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190100209"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["10.1002\/jgt.3190100209"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190100209","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,6]]}}}