Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II
Given a tree and a set P of non-trivial simple paths on it, VPT(P) is the VPT graph (i.e. the vertex intersection graph) of the paths P, and EPT(P) is the EPT graph (i.e. the edge intersection graph) of P. These graphs have been extensively studied in the literature. Given two (edge) intersecting pa...
| Κύριοι συγγραφείς: | , , , |
|---|---|
| Μορφή: | Άρθρο |
| Γλώσσα: | English |
| Έκδοση: |
Discrete Mathematics & Theoretical Computer Science
2018-01-01
|
| Σειρά: | Discrete Mathematics & Theoretical Computer Science |
| Θέματα: | |
| Διαθέσιμο Online: | https://dmtcs.episciences.org/1562/pdf |