Edge and vertex intersection of paths in a tree

Martin Charles Golumbic; Robert E. Jamison

doi:10.1016/0012-365X(85)90043-3

Edge and vertex intersection of paths in a tree

Martin Charles Golumbic, Robert E. Jamison

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	151-159
Number of pages	9
Journal	Discrete Mathematics
Volume	55
Issue number	2
DOIs	https://doi.org/10.1016/0012-365X(85)90043-3
State	Published - Jul 1985
Externally published	Yes

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

Access to Document

10.1016/0012-365X(85)90043-3

Cite this

@article{e33928cc42c04ae08310659f7831bf06,

title = "Edge and vertex intersection of paths in a tree",

abstract = "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.",

author = "Golumbic, {Martin Charles} and Jamison, {Robert E.}",

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).",

year = "1985",

month = jul,

doi = "10.1016/0012-365X(85)90043-3",

language = "English",

volume = "55",

pages = "151--159",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Edge and vertex intersection of paths in a tree

AU - Golumbic, Martin Charles

AU - Jamison, Robert E.

N1 - 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).

PY - 1985/7

Y1 - 1985/7

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0041959552&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(85)90043-3

DO - 10.1016/0012-365X(85)90043-3

M3 - Article

AN - SCOPUS:0041959552

SN - 0012-365X

VL - 55

SP - 151

EP - 159

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 2

ER -

Edge and vertex intersection of paths in a tree

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this