|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Peer Review Status:||Refereed|
|Title:||Equivalence of the filament and overlap graphs of subtrees of limited trees|
|Citation:||Enright J & Stewart L (2017) Equivalence of the filament and overlap graphs of subtrees of limited trees, Discrete Mathematics and Theoretical Computer Science, 19 (1), Art. No.: 20.|
|Abstract:||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.|
|Rights:||Copyright by the authors. The article is distributed under a Creative Commons Attribution 4.0 International License.|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.