{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T11:13:26Z","timestamp":1771413206999,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A stable cutset in a graph is a stable set whose deletion disconnects the\u00a0graph. It was conjectured by Caro and proved by Chen and Yu that any graph with $n$ vertices and at most $2n-4$ edges contains a stable cutset. The bound is tight, as\u00a0we will show that all graphs with $n$ vertices and $2n-3$ edges without stable cutset\u00a0arise recursively glueing together triangles and triangular prisms along an edge or\u00a0triangle. As a by-product, an algorithmic implication of our result will be pointed\u00a0out.<\/jats:p>","DOI":"10.37236\/2513","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T21:58:50Z","timestamp":1578693530000},"source":"Crossref","is-referenced-by-count":8,"title":["Extremal Graphs Having No Stable Cutset"],"prefix":"10.37236","volume":"20","author":[{"given":"Van Bang","family":"Le","sequence":"first","affiliation":[]},{"given":"Florian","family":"Pfender","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2013,2,18]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i1p35\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i1p35\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T06:26:55Z","timestamp":1579242415000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v20i1p35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,18]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2013,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/2513","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,18]]},"article-number":"P35"}}