Martin Charles Golumbic ; Marina Lipshteyn ; Michal Stern - Representations of Edge Intersection Graphs of Paths in a Tree

dmtcs:3439 - Discrete Mathematics & Theoretical Computer Science, January 1, 2005, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) - https://doi.org/10.46298/dmtcs.3439
Representations of Edge Intersection Graphs of Paths in a TreeArticle

Authors: Martin Charles Golumbic 1; Marina Lipshteyn 1; Michal Stern 1

  • 1 Caesarea Rothschild Institute and Department of Computer Science

Let $\mathcal{P}$ be a collection of nontrivial simple paths in a tree $T$. The edge intersection graph of $\mathcal{P}$, denoted by EPT($\mathcal{P}$), has vertex set that corresponds to the members of $\mathcal{P}$, and two vertices are joined by an edge if the corresponding members of $\mathcal{P}$ share a common edge in $T$. An undirected graph $G$ is called an edge intersection graph of paths in a tree, if $G = EPT(\mathcal{P})$ for some $\mathcal{P}$ and $T$. The EPT graphs are useful in network applications. Scheduling undirected calls in a tree or assigning wavelengths to virtual connections in an optical tree network are equivalent to coloring its EPT graph. It is known that recognition and coloring of EPT graphs are NP-complete problems. However, the EPT graphs restricted to host trees of vertex degree 3 are precisely the chordal EPT graphs, and therefore can be colored in polynomial time complexity. We prove a new analogous result that weakly chordal EPT graphs are precisely the EPT graphs with host tree restricted to degree 4. This also implies that the coloring of the edge intersection graph of paths in a degree 4 tree is polynomial. We raise a number of intriguing conjectures regarding related families of graphs.


Volume: DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
Section: Proceedings
Published on: January 1, 2005
Imported on: May 10, 2017
Keywords: Paths of a tree,Intersection graphs,Weakly chordal graphs,Coloring,EPT-graphs,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

4 Documents citing this article

Consultation statistics

This page has been seen 189 times.
This article's PDF has been downloaded 200 times.