Enright, J. and Stewart, L. (2007) Subtree filament graphs are subtree overlap graphs. Information Processing Letters, 104(6), pp. 228-232. (doi: 10.1016/j.ipl.2007.07.004)
Full text not currently available from Enlighten.
Abstract
We show that the class of intersection graphs of subtree filaments in a tree is identical to the class of overlap graphs of subtrees in a tree.
Item Type: | Articles |
---|---|
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: | Information Processing Letters |
Publisher: | Elsevier |
ISSN: | 0020-0190 |
ISSN (Online): | 1872-6119 |
Published Online: | 11 July 2007 |
University Staff: Request a correction | Enlighten Editors: Update this record