R. Balakrishnan and P. Paulraja, Powers of chordal graphs, Journal of the Australian Mathematical Society, vol.29, issue.02, pp.211-217, 1983.
DOI : 10.1017/S1446788700025696

H. L. Bodlaender and D. M. Thilikos, 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. Brandstädt, T. Van-bang-le, and . Szymczak, Duchet-type theorems for powers of HHD-free graphs, Discrete Mathematics, vol.177, issue.1-3, pp.9-16, 1997.
DOI : 10.1016/S0012-365X(96)00370-6

L. Chandran, M. C. Francis, and R. Mathew, Chordal Bipartite Graphs with High Boxicity, Graphs and Combinatorics, vol.40, issue.1, pp.353-362, 2011.
DOI : 10.1007/s00373-011-1017-2

L. Chandran and L. Shankar-ram, On the number of minimum cuts in a graph, Proceedings of the 8th International computing and combinatorics conference, pp.220-230, 2002.

L. Chandran, C. R. Subramanian, and V. V. Lozin, Graphs of low chordality, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00959026

J. Gerard, G. L. Chang, and . Nemhauser, The k-domination and k-stability problems on sun-free chordal graphs, SIAM Journal on Algebraic and Discrete Methods, vol.5, issue.3, pp.332-345, 1984.

Y. Dourisboure, Compact Routing Schemes for Generalised Chordal Graphs, Journal of Graph Algorithms and Applications, vol.9, issue.2, pp.277-297, 2005.
DOI : 10.7155/jgaa.00109

F. Feodor and . Dragan, Estimating all pairs shortest paths in restricted graph families: a unified approach, Journal of Algorithms, vol.57, issue.1, pp.1-21, 2005.

P. Duchet, Classical Perfect Graphs, Ann. Discrete Math, vol.21, pp.67-96, 1984.
DOI : 10.1016/S0304-0208(08)72924-4

C. Flotow, On powers of m-trapezoid graphs, Discrete Applied Mathematics, vol.63, issue.2, pp.187-192, 1995.
DOI : 10.1016/0166-218X(95)00062-V

C. Flotow, On powers of circular arc graphs and proper circular arc graphs, Discrete Applied Mathematics, vol.69, issue.3, pp.199-207, 1996.
DOI : 10.1016/0166-218X(95)00091-5

A. Lubiw, ?-free matrices. Master's thesis, Dept. of combinatorics and Optimization, 1982.

A. Raychaudhuri, On powers of interval and unit interval graphs, Congr.Numerantium, vol.59, pp.235-242, 1987.

A. Raychaudhuri, On powers of strongly chordal and circular graphs, Ars Combinatoria, vol.34, pp.147-160, 1992.

J. P. Spinrad, Finding large holes, Information Processing Letters, vol.39, issue.4, pp.227-229, 1991.
DOI : 10.1016/0020-0190(91)90184-J