Recognizing Weakly Triangulated Graphs by Edge Separability, Nordic Journal of Computing Fall, vol.7, issue.3, pp.164-177, 2000. ,
DOI : 10.1007/3-540-44985-X_13
Scheduling of virtual connections in fast networks, Proc. of the 4th Parallel Systems and Algorithms Workshop (PASA'96, pp.13-32, 1996. ,
A recognition algorithm for the intersection graphs of paths in trees, pp.211-227, 1978. ,
Algorithmic Graph Theory and Perfect Graphs, Annals of Discrete Math, vol.57, 2004. ,
Edge and vertex intersection of paths in a tree, Discrete Mathematics, vol.55, issue.2, pp.151-159, 1985. ,
DOI : 10.1016/0012-365X(85)90043-3
The edge intersection graphs of paths in a tree, Journal of Combinatorial Theory, Series B, vol.38, issue.1, pp.8-22, 1985. ,
DOI : 10.1016/0095-8956(85)90088-7
The recognition of k-EPT graphs, Congressus Numernatium, vol.171, pp.129-139, 2004. ,
The edge intersection graphs of paths in a tree, Journal of Combinatorial Theory, Series B, vol.38, issue.1, pp.submit- ted ,
DOI : 10.1016/0095-8956(85)90088-7
The complete hierarchy of VPT, k-EPT and chordal graphs, abstract accepted for presentation at CTW05 ,
Optimizing weakly triangulated graphs, Graphs and Combinatorics, vol.8, issue.1, pp.339-349, 1989. ,
DOI : 10.1007/BF01788689
Weakly chordal graph algorithms via handles, Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, pp.42-49, 2000. ,
Constant tolerance intersection graphs of subtrees of a tree, Discrete Math, pp.27-46, 2005. ,
Tolerance intersection graphs on binary trees with constant tolerance 3, Discrete Math, pp.115-131, 2000. ,
Connectivity threshold for random chordal graphs, Graphs and Combinatorics, vol.2, issue.2, pp.177-181, 1991. ,
DOI : 10.1007/BF01788142
Triangulated edge intersection graphs of paths in a tree, pp.217-220, 1985. ,
Decomposition by clique separators, Discrete Math, pp.221-232, 1985. ,