Please use this identifier to cite or link to this item:
http://hdl.handle.net/1893/25469
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Enright, Jessica | en_UK |
dc.contributor.author | Stewart, Lorna | en_UK |
dc.date.accessioned | 2018-01-26T23:48:24Z | - |
dc.date.available | 2018-01-26T23:48:24Z | - |
dc.date.issued | 2017-06-20 | en_UK |
dc.identifier.other | 20 | en_UK |
dc.identifier.uri | http://hdl.handle.net/1893/25469 | - |
dc.description.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. | en_UK |
dc.language.iso | en | en_UK |
dc.publisher | Discrete Mathematics & Theoretical Computer Science | en_UK |
dc.relation | 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. https://doi.org/10.23638/DMTCS-19-1-20 | en_UK |
dc.rights | Copyright by the authors. The article is distributed under a Creative Commons Attribution 4.0 International License. | en_UK |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | en_UK |
dc.title | Equivalence of the filament and overlap graphs of subtrees of limited trees | en_UK |
dc.type | Journal Article | en_UK |
dc.identifier.doi | 10.23638/DMTCS-19-1-20 | en_UK |
dc.citation.jtitle | Discrete Mathematics and Theoretical Computer Science | en_UK |
dc.citation.issn | 1365-8050 | en_UK |
dc.citation.volume | 19 | en_UK |
dc.citation.issue | 1 | en_UK |
dc.citation.publicationstatus | Published | en_UK |
dc.citation.peerreviewed | Refereed | en_UK |
dc.type.status | VoR - Version of Record | en_UK |
dc.citation.date | 20/06/2017 | en_UK |
dc.contributor.affiliation | Mathematics | en_UK |
dc.contributor.affiliation | University of Alberta | en_UK |
dc.identifier.isi | WOS:000419277900020 | en_UK |
dc.identifier.scopusid | 2-s2.0-85030870455 | en_UK |
dc.identifier.wtid | 527296 | en_UK |
dc.contributor.orcid | 0000-0002-0266-3292 | en_UK |
dc.date.accepted | 2017-06-02 | en_UK |
dcterms.dateAccepted | 2017-06-02 | en_UK |
dc.date.filedepositdate | 2017-06-08 | en_UK |
rioxxterms.apc | not charged | en_UK |
rioxxterms.type | Journal Article/Review | en_UK |
rioxxterms.version | VoR | en_UK |
local.rioxx.author | Enright, Jessica|0000-0002-0266-3292 | en_UK |
local.rioxx.author | Stewart, Lorna| | en_UK |
local.rioxx.project | Internal Project|University of Stirling|https://isni.org/isni/0000000122484331 | en_UK |
local.rioxx.freetoreaddate | 2017-06-20 | en_UK |
local.rioxx.licence | http://www.rioxx.net/licenses/under-embargo-all-rights-reserved||2017-06-20 | en_UK |
local.rioxx.licence | http://creativecommons.org/licenses/by/4.0/|2017-06-20| | en_UK |
local.rioxx.filename | 1508.01441.pdf | en_UK |
local.rioxx.filecount | 1 | en_UK |
local.rioxx.source | 1365-8050 | en_UK |
Appears in Collections: | Computing Science and Mathematics Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
1508.01441.pdf | Fulltext - Published Version | 255.77 kB | Adobe PDF | View/Open |
This item is protected by original copyright |
A file in this item is licensed under a Creative Commons License
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/
If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.