{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T15:05:16Z","timestamp":1743433516620},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2016,3]]},"abstract":"<jats:p> An [Formula: see text]-chord of a cycle [Formula: see text] is a chord that forms a new cycle with a length-[Formula: see text] subpath of [Formula: see text] when [Formula: see text] is at most half the length of [Formula: see text]. Define a graph to be [Formula: see text]-strongly chordal if, for every [Formula: see text], every cycle long enough to have an [Formula: see text]-chord always has an [Formula: see text]-chord. The [Formula: see text]-strongly chordal and [Formula: see text]-strongly chordal graphs are, respectively, the chordal and strongly chordal graphs. Several characterizations of [Formula: see text]-strongly chordal graphs are proved, along with details of the class of [Formula: see text]-strongly chordal graphs. <\/jats:p>","DOI":"10.1142\/s1793830916500026","type":"journal-article","created":{"date-parts":[[2015,10,27]],"date-time":"2015-10-27T03:11:52Z","timestamp":1445915512000},"page":"1650002","source":"Crossref","is-referenced-by-count":1,"title":["Strengthening strongly chordal graphs"],"prefix":"10.1142","volume":"08","author":[{"given":"Terry A.","family":"McKee","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, Wright State University, Dayton, Ohio 45435, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2016,2,26]]},"reference":[{"key":"S1793830916500026BIB001","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796"},{"key":"S1793830916500026BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(97)00268-9"},{"key":"S1793830916500026BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90154-1"},{"key":"S1793830916500026BIB004","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1629"},{"key":"S1793830916500026BIB005","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719802"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830916500026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:02:00Z","timestamp":1565107320000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830916500026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,26]]},"references-count":5,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2016,2,26]]},"published-print":{"date-parts":[[2016,3]]}},"alternative-id":["10.1142\/S1793830916500026"],"URL":"https:\/\/doi.org\/10.1142\/s1793830916500026","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,26]]}}}