The edge intersection graphs of paths in a tree

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.

[1]  K. R. Parthasarathy,et al.  The strong perfect-graph conjecture is true for K1, 3-free graphs , 1976, J. Comb. Theory, Ser. B.

[2]  Robert E. Jamison-Waldner.  PARTITION NUMBERS FOR TREES AND ORDERED SETS , 1981 .

[3]  K. R. Parthasarathy,et al.  The validity of the strong perfect-graph conjecture for (K4-e)-free graphs , 1979, J. Comb. Theory, Ser. B.

[4]  C. Shannon.  A Theorem on Coloring the Lines of a Network , 1949 .

[5]  A. Tucker,et al.  The Strong Perfect Graph Conjecture for Planar Graphs , 1973, Canadian Journal of Mathematics.

[6]  Alan Tucker,et al.  Critical perfect graphs and perfect 3-chromatic graphs , 1977, J. Comb. Theory, Ser. B.

[7]  Leslie E. Trotter,et al.  The Strong Perfect Graph Theorem for a Class of Partitionable Graphs , 1984 .

[8]  M. Golummc.  Algorithmic graph theory and perfect graphs , 1980 .

[9]  Witold Lipski,et al.  Information Storage and Retrieval - Mathematical Foundations II (Combinatorial Problems) , 1976, Theor. Comput. Sci..

[10]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[11]  Eshrat Arjomandi.  An Efficient Algorithm for Colouring the Edges of a Graph With Δ + 1 Colours , 1982 .

[12]  Robert E. Tarjan,et al.  Decomposition by clique separators , 1985, Discret. Math..

[13]  P. Renz.  Intersection representations of graphs by arcs. , 1970 .

[14]  A. Tucker,et al.  Coloring a Family of Circular Arcs , 1975 .

[15]  Leslie E. Trotter,et al.  Line perfect graphs , 1977, Math. Program..

[16]  Mark A. Buckingham,et al.  Recent Results on The Strong Perfect Graph Conjecture , 1984 .

[17]  Charles M. Grinstead.  The strong perfect graph conjecture for toroifal graphs , 1981, J. Comb. Theory, Ser. B.

[18]  C. Zheng,et al.  ; 0 ; , 1951 .

[19]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[20]  Martin Charles Golumbic,et al.  Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture , 1983, Discret. Math..

[21]  Fanica Gavril,et al.  A recognition algorithm for the intersection graphs of paths in trees , 1978, Discret. Math..

[22]  The Helly-type property of non-trivial intervals on a tree , 1981 .