Edge and vertex intersection of paths in a tree

Martin Charles Golumbic, Robert E. Jamison

Research output: Contribution to journalArticlepeer-review


In this paper we continue the investigation of the class of edge intersection graphs of a collection of paths in a tree (EPT graphs) where two paths edge intersect if they share an edge. The class of EPT graphs differs from the class known as path graphs, the latter being the class of vertex intersection graphs of paths in a tree. A characterization is presented here showing when a path graph is an EPT graph. In particular, the classes of path graphs and EPT graphs coincide on trees all of whose vertices have degree at most 3. We then prove that it is an NP-complete problem to recognize whether a graph is an EPT graph.

Original languageEnglish
Pages (from-to)151-159
Number of pages9
JournalDiscrete Mathematics
Issue number2
StatePublished - Jul 1985
Externally publishedYes

Bibliographical note

Funding Information:
The class of EPT graphs is equivalent to the fundamental cycle graphs of Syslo [S, 91. Golumbic and Jamison [4] demonstrated that one can find a maximum *This research was supported in part by NSF Grant ISP-80-11451 (EPSCOR).

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Edge and vertex intersection of paths in a tree'. Together they form a unique fingerprint.

Cite this