Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.23638/DMTCS-19-1-20 | DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE |
Keywords | Field | DocType |
graph algorithms,intersection graphs,filament graphs | Discrete mathematics,Indifference graph,Combinatorics,Lévy family of graphs,Tree (data structure),Chordal graph,Equivalence (measure theory),Pathwidth,Mathematics,A* search algorithm,Maximal independent set | Journal |
Volume | Issue | ISSN |
19.0 | 1.0 | 1462-7264 |
Citations | PageRank | References |
1 | 0.39 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| jessica enright | 1 | 1 | 0.39 |
| Lorna Stewart | 2 | 361 | 28.05 |