Enright, J. and Stewart, L. (2017) Equivalence of the filament and overlap graphs of subtrees of limited trees. Discrete Mathematics and Theoretical Computer Science, 19(1), 20. (doi: 10.23638/DMTCS-19-1-20)
|
Text
203104.pdf - Published Version Available under License Creative Commons Attribution. 261kB |
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 generalise the previously known results mentioned above.
| Item Type: | Articles |
|---|---|
| Additional Information: | The authors gratefully acknowledge support from an NSERC Discovery grant, an iCORE ICT Graduate Student Scholarship and a University of Alberta Dissertation Fellowship. |
| Status: | Published |
| Refereed: | Yes |
| Glasgow Author(s) Enlighten ID: | Enright, Dr Jessica |
| Authors: | Enright, J., and Stewart, L. |
| College/School: | College of Science and Engineering > School of Computing Science |
| Journal Name: | Discrete Mathematics and Theoretical Computer Science |
| Publisher: | DMTCS |
| ISSN: | 1462-7264 |
| ISSN (Online): | 1365-8050 |
| Copyright Holders: | Copyright © 2017 The Authors |
| First Published: | First published in Discrete Mathematics and Theoretical Computer Science 19(1): 20 |
| Publisher Policy: | Reproduced under a Creative Commons License |
University Staff: Request a correction | Enlighten Editors: Update this record
Deposit and Record Details
Deposit and Record Details