S. Chaplick, PQR-trees and undirected path graphs, Canada, 2008.

E. Dahlhaus and G. Bailey, Recognition of path graphs in linear time, 5th Italian Conference on Theoretical Computer Science, pp.201-210, 1995.

F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, J. Combin. Theory B, vol.16, pp.47-56, 1974.

F. Gavril, A recognition algorithm for the intersection graphs of paths in trees, Discrete Math, vol.23, pp.211-227, 1978.

M. C. Golumbic, Algorithmic graph theory and perfect graphs, Annals Disc. Math, vol.57, 2004.

D. R. Fulkerson and O. A. Gross, Incidence matrices and interval graphs, Pacific J. Math, vol.15, pp.835-855, 1965.

B. Lévêque, F. Maffray, and M. Preissmann, Characterizing path graphs by forbidden induced subgraphs, Journal of Graph Theory, vol.62, pp.369-384, 2009.

T. A. Mckee and F. R. Mcmorris, Topics in intersection graph theory. SIAM Monographs on Discrete Mathematics and Applications, 1999.

C. L. Monma and V. K. Wei, Intersection graphs of paths in a tree, Journal of Combinatorial Theory B, vol.41, pp.141-181, 1986.

B. S. Panda, The forbidden subgraph characterization of directed vertex graphs, Discrete Mathematics, vol.196, pp.239-256, 1999.

A. A. Schäffer, A faster algorithm to recognize undirected path graphs, Discrete Appl. Math, vol.43, pp.261-295, 1993.

S. B. Tondato, Grafos Cordales:Árboles clique y Representaciones canónicas, 2009.