Distance-hereditary graphs, Journal of Combinatorial Theory, Series B, vol.41, issue.2, pp.182-208, 1986. ,
DOI : 10.1016/0095-8956(86)90043-2
A tourist guide through treewidth, Acta Cybernetica, vol.11, pp.1-21, 1993. ,
Treewidth for graphs with small chordality, Discrete Applied Mathematics, vol.79, issue.1-3, pp.45-61, 1997. ,
DOI : 10.1016/S0166-218X(97)00031-0
A Note on Distance Approximating Trees in Graphs, European Journal of Combinatorics, vol.21, issue.6, pp.761-766, 2000. ,
DOI : 10.1006/eujc.1999.0381
On the number of min?cuts in a graph, Proceedings of the 8th International computing and combinatorics conference, pp.220-230, 2002. ,
A spectral lower bound for the treewidth of a graph and its consequences, Information Processing Letters, vol.87, issue.4, pp.195-200, 2003. ,
DOI : 10.1016/S0020-0190(03)00286-2
The Strong Perfect Graph Theorem, manuscript, 2003. ,
A new upper bound for the length of snakes, Combinatorica, vol.15, issue.2, pp.109-120, 1985. ,
DOI : 10.1007/BF02579373
Estimating all pairs shortest paths in restricted graph families: a unified approach, Journal of Algorithms ,
Classical Perfect Graphs, Annals of Discrete Mathematics, vol.21, pp.67-96, 1984. ,
DOI : 10.1016/S0304-0208(08)72924-4
Transitiv orientierbare Graphen, Acta Mathematica Academiae Scientiarum Hungaricae, vol.51, issue.1-2, pp.25-66, 1967. ,
DOI : 10.1007/BF02020961
Algorithms for maximum weight induced paths, Information Processing Letters, vol.81, issue.4, pp.203-208, 2002. ,
DOI : 10.1016/S0020-0190(01)00222-8
The intersection graphs of subtrees in trees are exactly the chordal graphs, Journal of Combinatorial Theory, Series B, vol.16, issue.1, pp.47-56, 1974. ,
DOI : 10.1016/0095-8956(74)90094-X
Perfect Elimination and Chordal Bipartite Graphs, Journal of Graph Theory, vol.5, issue.2, pp.155-163, 1978. ,
DOI : 10.1002/jgt.3190020209
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
Edge and vertex intersection of paths in a tree, Discrete Mathematics, vol.55, issue.2, pp.55-151, 1985. ,
DOI : 10.1016/0012-365X(85)90043-3
The recognition of k-EPT graphs, Congressus Numerantium, pp.171-129, 2004. ,
Tolerance graphs Cambridge Studies in Advanced Mathematics , 89, 2004. ,
Lower bound of the hadwiger number of graphs by their average degree, Combinatorica, vol.7, issue.4, pp.307-316, 1984. ,
DOI : 10.1007/BF02579141
Edge-Disjoint Spanning Trees of Finite Graphs, Journal of the London Mathematical Society, vol.1, issue.1, pp.445-450, 1961. ,
DOI : 10.1112/jlms/s1-36.1.445
Matroidal graphs Discrete Math, pp.263-286, 1977. ,
Circular permutation graphs, Networks, vol.69, issue.4, pp.12-429, 1982. ,
DOI : 10.1002/net.3230120407
Combinatorics and partially ordered sets. Dimension theory. Johns Hopkins Series in the Mathematical Sciences, 1992. ,
Node-Deletion Problems on Bipartite Graphs, SIAM Journal on Computing, vol.10, issue.2, pp.310-327, 1981. ,
DOI : 10.1137/0210022