Geodesic
Equivalence of the filament and overlap graphs of subtrees of limited trees
Discrete mathematics & theoretical computer science, Tome 19 (2017-2018) no. 1

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2017_19_1_a16,
     author = {Enright, Jessica and Stewart, Lorna},
     title = {Equivalence of the filament and overlap graphs of subtrees of limited trees},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {19},
     number = {1},
     year = {2017-2018},
     doi = {10.23638/DMTCS-19-1-20},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-19-1-20/}
}
TY  - JOUR
AU  - Enright, Jessica
AU  - Stewart, Lorna
TI  - Equivalence of the filament and overlap graphs of subtrees of limited trees
JO  - Discrete mathematics & theoretical computer science
PY  - 2017-2018
VL  - 19
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-19-1-20/
DO  - 10.23638/DMTCS-19-1-20
LA  - en
ID  - DMTCS_2017_19_1_a16
ER  - 
%0 Journal Article
%A Enright, Jessica
%A Stewart, Lorna
%T Equivalence of the filament and overlap graphs of subtrees of limited trees
%J Discrete mathematics & theoretical computer science
%D 2017-2018
%V 19
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-19-1-20/
%R 10.23638/DMTCS-19-1-20
%G en
%F DMTCS_2017_19_1_a16
Enright, Jessica; Stewart, Lorna. Equivalence of the filament and overlap graphs of subtrees of limited trees. Discrete mathematics & theoretical computer science, Tome 19 (2017-2018) no. 1. doi: 10.23638/DMTCS-19-1-20

Cité par Sources :