Publication
Journal of Combinatorial Theory, Series B
Paper

The edge intersection graphs of paths in a tree

View publication

Abstract

The class of edge intersection graphs of a collection of paths in a tree (EPT graphs) is investigated, where two paths edge intersect if they share an edge. The cliques of an EPT graph are characterized and shown to have strong Helly number 4. From this it is demonstrated that the problem of finding a maximum clique of an EPT graph can be solved in polynomial time. It is shown that the strong perfect graph conjecture holds for EPT graphs. Further complexity results follow from the observation that every line graph is an EPT graph. The class of EPT graphs is equivalent to the class of fundamental cycle graphs. © 1985.

Date

01 Jan 1985

Publication

Journal of Combinatorial Theory, Series B

Authors

Share