{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:19Z","timestamp":1740155959036,"version":"3.37.3"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2018,2]]},"abstract":"<jats:p>Define a new class of graphs by cycles of length 5 or more always having adjacent chords. This is equivalent to cycles of length 5 or more always having noncrossing chords, which is a property that has a known forbidden induced subgraph characterization. Another characterization comes from viewing the graphs in this class in contrast to distance-hereditary graphs (which are characterized by cycles of length 5 or more always having crossing chords). Moreover, the graphs in the new class are those in which every edge of every cycle [Formula: see text] of length 5 or more forms a triangle with a third vertex of [Formula: see text] (generalizing that a graph is chordal if and only if every edge of every cycle [Formula: see text] of length 4 or more forms a triangle with a third vertex of [Formula: see text]). This leads to a strategically-required subgraph characterization of the new class.<\/jats:p>","DOI":"10.1142\/s1793830918500039","type":"journal-article","created":{"date-parts":[[2017,11,3]],"date-time":"2017-11-03T10:31:25Z","timestamp":1509705085000},"page":"1850003","source":"Crossref","is-referenced-by-count":0,"title":["Requiring adjacent chords in cycles"],"prefix":"10.1142","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0745-6716","authenticated-orcid":false,"given":"Terry A.","family":"McKee","sequence":"first","affiliation":[{"name":"Department of Mathematics &amp; Statistics, Wright State University, Dayton, Ohio 45435, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2018,2,14]]},"reference":[{"key":"S1793830918500039BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00401-5"},{"key":"S1793830918500039BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90043-2"},{"key":"S1793830918500039BIB003","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796"},{"key":"S1793830918500039BIB004","doi-asserted-by":"publisher","DOI":"10.1137\/0605034"},{"key":"S1793830918500039BIB005","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/28.4.417"},{"key":"S1793830918500039BIB006","doi-asserted-by":"crossref","first-page":"5","DOI":"10.37236\/911","volume":"15","author":"McKee T. A.","year":"2008","journal-title":"Electron. J. Combin."},{"key":"S1793830918500039BIB007","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1606"},{"key":"S1793830918500039BIB008","first-page":"357","volume":"4","author":"McKee T. A.","year":"2013","journal-title":"J. Comb."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830918500039","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T01:34:14Z","timestamp":1603244054000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830918500039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":8,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2018,2,14]]},"published-print":{"date-parts":[[2018,2]]}},"alternative-id":["10.1142\/S1793830918500039"],"URL":"https:\/\/doi.org\/10.1142\/s1793830918500039","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2018,2]]}}}