{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:32Z","timestamp":1740155972443,"version":"3.37.3"},"reference-count":7,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2019,6]]},"abstract":"<jats:p> Strongly chordal graphs can be characterized as chordal graphs in which every even cycle of length at least [Formula: see text] has an odd chord (a chord whose endpoints are an odd distance apart in the cycle subgraph). Define \u201coddly chordal graphs\u201d to be chordal graphs in which every odd cycle of length at least [Formula: see text] has an odd chord. Strongly chordal graphs are shown to be oddly chordal, and the oddly chordal graphs are characterized by forbidding induced \u201cdouble [Formula: see text]-sun\u201d subgraphs. Both strongly chordal and oddly chordal graphs are also characterized in terms of uncrossed chords of appropriate-length cycles. <\/jats:p>","DOI":"10.1142\/s1793830919500344","type":"journal-article","created":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T05:24:31Z","timestamp":1554873871000},"page":"1950034","source":"Crossref","is-referenced-by-count":0,"title":["Odd twists on strongly chordal graphs"],"prefix":"10.1142","volume":"11","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"}]}],"member":"219","published-online":{"date-parts":[[2019,7,9]]},"reference":[{"key":"S1793830919500344BIB001","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796"},{"key":"S1793830919500344BIB002","doi-asserted-by":"publisher","DOI":"10.1137\/0605034"},{"key":"S1793830919500344BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(97)00268-9"},{"key":"S1793830919500344BIB004","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1757"},{"key":"S1793830919500344BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90154-1"},{"key":"S1793830919500344BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00107-7"},{"key":"S1793830919500344BIB007","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1629"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830919500344","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:17:33Z","timestamp":1565108253000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830919500344"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":7,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2019,7,9]]},"published-print":{"date-parts":[[2019,6]]}},"alternative-id":["10.1142\/S1793830919500344"],"URL":"https:\/\/doi.org\/10.1142\/s1793830919500344","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2019,6]]}}}