{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:39:56Z","timestamp":1753889996796,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"Graph Theory","license":[{"start":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T00:00:00Z","timestamp":1497916800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T00:00:00Z","timestamp":1497916800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T00:00:00Z","timestamp":1497916800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>The overlap graphs of subtrees of a tree are equivalent to subtree filament graphs, the overlap graphs of subtrees of a star are cocomparability graphs, and the overlap graphs of subtrees of a caterpillar are interval filament graphs. In this paper, we show the equivalence of many more classes of subtree overlap and subtree filament graphs, and equate them to classes of complements of cochordal-mixed graphs. Our results generalize the previously known results mentioned above.<\/jats:p>","DOI":"10.23638\/dmtcs-19-1-20","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T16:34:15Z","timestamp":1743698055000},"source":"Crossref","is-referenced-by-count":0,"title":["Equivalence of the filament and overlap graphs of subtrees of limited trees"],"prefix":"10.23638","volume":"Vol. 19 no. 1","author":[{"given":"Jessica","family":"Enright","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorna","family":"Stewart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2017,6,20]]},"container-title":["Discrete Mathematics &amp; Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1508.01441v4","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1508.01441v4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T16:34:15Z","timestamp":1743698055000},"score":1,"resource":{"primary":{"URL":"http:\/\/dmtcs.episciences.org\/1274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,20]]},"references-count":0,"journal-issue":{"issue":"Graph Theory","published-online":{"date-parts":[[2017,6,20]]}},"URL":"https:\/\/doi.org\/10.23638\/dmtcs-19-1-20","relation":{"has-preprint":[{"id-type":"arxiv","id":"1508.01441v3","asserted-by":"subject"},{"id-type":"arxiv","id":"1508.01441v2","asserted-by":"subject"},{"id-type":"arxiv","id":"1508.01441v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1508.01441","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1508.01441","asserted-by":"subject"}]},"ISSN":["1365-8050"],"issn-type":[{"type":"electronic","value":"1365-8050"}],"subject":[],"published":{"date-parts":[[2017,6,20]]},"article-number":"1274"}}