Let T = (V(T), E(T)) be a tree and B = {Pi} denote a collection of non-trivial (i.e., of length at least 1) simple paths in T, where a path P= (v,, u2, . . . , Q) is considered in the sequel as the collection {{uJ, {Q}, . . . ,{z)J, {u,, u2}, {u2, I+}, _ . . , {w,-,, Q}}. The intersection graph 0(S, 9) of 9 over set S has vertices which correspond to the… (More)

@article{Syslo1985TriangulatedEI,
title={Triangulated edge intersection graphs of paths in a tree},
author={Maciej M. Syslo},
journal={Discrete Mathematics},
year={1985},
volume={55},
pages={217-220}
}