G. Agnarsson, R. Greenlaw, and M. M. Halldórsson, On powers of chordal graphs and their coloring, Congr. Numer, vol.144, p.4165, 2000.

L. S. Chandran and R. Mathew, Bipartite powers of k-chordal graphs, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00980750

L. S. Chandran, M. 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

M. Chang, M. Ko, and H. Lu, Linear-Time Algorithms for Tree Root Problems, SWAT 2006, pp.411-422, 2006.
DOI : 10.1007/11785293_38

M. Chen and G. J. Chang, Families of Graphs Closed Under Taking Powers, Graphs and Combinatorics, vol.17, issue.2, pp.207-212, 2001.
DOI : 10.1007/PL00007241

E. Dahlhaus and P. Duchet, On strongly chordal graphs, Ars Combin, vol.24, pp.23-30, 1987.

B. Farzad, L. C. Lau, V. B. Le, and N. N. Tuy, Computing graph roots without short cycles, STACS 2009, pp.397-408, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00360037

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

P. Hell and J. Huang, Interval bigraphs and circular arc graphs, Journal of Graph Theory, vol.178, issue.4, pp.313-327, 2004.
DOI : 10.1002/jgt.20006

P. E. Kearney and D. G. , Tree Powers, Journal of Algorithms, vol.29, issue.1, pp.111-131, 1998.
DOI : 10.1006/jagm.1998.9999

L. C. Lau, Bipartite roots of graphs, ACM Transactions on Algorithms, vol.2, issue.2, pp.178-208, 2006.
DOI : 10.1145/1150334.1150337

L. C. Lau and D. G. , Recognizing Powers of Proper Interval, Split, and Chordal Graphs, SIAM Journal on Discrete Mathematics, vol.18, issue.1, pp.83-102, 2004.
DOI : 10.1137/S0895480103425930

V. B. Le and N. T. Nguyen, Hardness Results and Efficient Algorithms for Graph Powers, WG 2009, pp.238-249, 2010.
DOI : 10.1007/978-3-642-11409-0_21

Y. Lin and S. S. Skiena, Algorithms for Square Roots of Graphs, SIAM Journal on Discrete Mathematics, vol.8, issue.1, pp.99-118, 1995.
DOI : 10.1137/S089548019120016X

A. Lubiw, Doubly Lexical Orderings of Matrices, SIAM Journal on Computing, vol.16, issue.5, pp.854-879, 1987.
DOI : 10.1137/0216057

R. Motwani and M. Sudan, Computing roots of graphs is hard, Discrete Applied Mathematics, vol.54, issue.1, pp.81-88, 1994.
DOI : 10.1016/0166-218X(94)00023-9

H. Müller, Recognizing interval digraphs and interval bigraphs in polynomial time, Discrete Applied Mathematics, vol.78, issue.1-3, pp.189-205, 1997.
DOI : 10.1016/S0166-218X(97)00027-9

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

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