Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Equivalence of the f ...
Article

Equivalence of the filament and overlap graphs of subtrees of limited trees

Jessica Enright, Lorna Stewart
Download article
Open on arXiv
Submitted on
June 15, 2017
Accepted on
June 6, 2017
Published on
June 20, 2017
Last modified on
March 31, 2025
Volume 19
vol. 19:1
Graph Theory
DOI
10.23638/DMTCS-19-1-20
License
arXiv.org - Non-exclusive license to distribute
Natural Sciences and Engineering Research Council of Canada
Indicators
1134
Views
1518
Downloads

Equivalence of the filament and overlap graphs of subtrees of limited trees

Jessica Enright, Lorna Stewart
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.
Keywords
  • Computer Science - Discrete Mathematics
Preview
Loading PDF preview...