Asteroidal sets in graphs, Lecture Notes in Comput. Sci, vol.1335, pp.229-241, 1997. ,
DOI : 10.1007/BFb0024501
Asteroids in rooted and directed path graphs, Electronic Notes in Discrete Mathematics, vol.32, 2009. ,
DOI : 10.1016/j.endm.2009.02.010
URL : https://hal.archives-ouvertes.fr/hal-00347163
Characterizing directed path graphs by forbidden asteroids, Journal of Graph Theory, vol.196, issue.2, 2011. ,
DOI : 10.1002/jgt.20543
URL : https://hal.archives-ouvertes.fr/lirmm-00627742
From Path Graphs to Directed Path Graphs, Lecture Notes in Comput. Sci, vol.43, pp.256-265, 2010. ,
DOI : 10.1016/0166-218X(93)90116-6
URL : https://hal.archives-ouvertes.fr/lirmm-00620726
The intersection graphs of subtrees in trees are exactly the chordal graphs, Journal of Combinatorial Theory, Series B, vol.16, issue.1, pp.47-5610, 1974. ,
DOI : 10.1016/0095-8956(74)90094-X
Representation of finite graph by a set of intervals on the real line, Fund. Math, pp.45-64, 1962. ,
Characterizing path graphs by forbidden induced subgraphs, Journal of Graph Theory, vol.19, issue.4, pp.369-384, 2009. ,
DOI : 10.1002/jgt.20407
The leafage of a chordal graph, Discussiones Mathematicae Graph Theory, vol.18, issue.1, pp.23-48, 1998. ,
DOI : 10.7151/dmgt.1061
Intersection graphs of paths in a tree, Journal of Combinatorial Theory, Series B, vol.41, issue.2, pp.141-18110, 1986. ,
DOI : 10.1016/0095-8956(86)90042-0
The forbidden subgraph characterization of directed vertex graphs, Discrete Math, pp.239-256, 1999. ,