A. Adamaszek and M. Adamaszek, Uniqueness of graph square roots of girth six, The Electronic Journal of Combinatorics, vol.18, issue.P1391, 2011.

G. Agnarsson and M. M. Halldórsson, Coloring Powers of Planar Graphs, SIAM Journal on Discrete Mathematics, vol.16, issue.4, pp.651-662, 2003.
DOI : 10.1137/S0895480100367950
URL : http://www.hi.is/~mmh/papers/sidma-powers.ps

M. Aigner and M. Fromme, A game of cops and robbers, Discrete Applied Mathematics, vol.8, issue.1, pp.1-12, 1984.
DOI : 10.1016/0166-218X(84)90073-8

A. Berry, R. Pogorelcnik, and G. Simonet, Organizing the atoms of the clique separator decomposition into an atom tree, Discrete Applied Mathematics, vol.177, pp.1-13, 2014.
DOI : 10.1016/j.dam.2014.05.030
URL : https://hal.archives-ouvertes.fr/hal-01375915

H. Bodlaender, S. Kratsch, V. Kreuzen, O. Kwon, and S. Ok, Characterizing width two for variants of treewidth, Discrete Applied Mathematics, vol.216, issue.1, pp.29-46, 2017.
DOI : 10.1016/j.dam.2015.01.015

M. Bonamy, B. Lévêque, and A. Pinlou, 2-Distance Coloring of Sparse Graphs, Journal of Graph Theory, vol.17, issue.3, pp.190-218, 2014.
DOI : 10.1137/S0895480101390448
URL : https://hal.archives-ouvertes.fr/lirmm-00782852

J. A. Bondy and U. S. Murty, Graph theory, Grad. Texts in Math, vol.244, 2008.
DOI : 10.1007/978-1-84628-970-5

V. Bouchitté and I. Todinca, Treewidth and Minimum Fill-in: Grouping the Minimal Separators, SIAM Journal on Computing, vol.31, issue.1, pp.212-232, 2001.
DOI : 10.1137/S0097539799359683

M. Chang, M. Ko, and H. Lu, Linear-time algorithms for tree root problems, SWAT, pp.411-422, 2006.
DOI : 10.1007/s00453-013-9815-y
URL : http://www.csie.ntu.edu.tw/~hil/paper/swat06.pdf

M. Cochefert, J. Couturier, P. A. Golovach, D. Kratsch, and D. Paulusma, Parameterized Algorithms for Finding Square Roots, Algorithmica, vol.6, issue.2, pp.602-629, 2016.
DOI : 10.1137/0206036
URL : http://arxiv.org/pdf/1310.5469

G. Ducoffe, Finding cut-vertices in the square roots of a graph Available at https

G. Ducoffe and D. Coudert, Clique-decomposition revisited, pp.1266147-2017
URL : https://hal.archives-ouvertes.fr/hal-01266147

B. Farzad and M. Karimi, Square-root finding problem in graphs, a complete dichotomy theorem, 2012.

B. Farzad, L. C. Lau, and N. N. Tuy, Complexity of Finding Graph Roots with??Girth Conditions, Algorithmica, vol.6, issue.11, pp.38-53, 2012.
DOI : 10.1137/0206036

H. Fleischner, The square of every two-connected graph is Hamiltonian, Journal of Combinatorial Theory, Series B, vol.16, issue.1, pp.29-34, 1974.
DOI : 10.1016/0095-8956(74)90091-4

T. Gallai, Graphen mit triangulierbaren ungeraden vielecken, Magyar Tud. Akad. Mat. Kutató Int. Közl, vol.7, pp.3-36, 1962.

P. Golovach, P. Heggernes, D. Kratsch, P. Lima, and D. Paulusma, Algorithms for Outerplanar Graph Roots and??Graph Roots of Pathwidth at Most 2, 2017.
DOI : 10.1016/0012-365X(79)90060-8

P. Golovach, D. Kratsch, D. Paulusma, and A. Stewart, A linear kernel for finding square roots of almost planar graphs, SWAT, pp.1-4, 2016.
DOI : 10.1016/j.tcs.2017.05.008

P. A. Golovach, D. Kratsch, D. Paulusma, and A. Stewart, Finding Cactus Roots in Polynomial Time, IWOCA, pp.361-372, 2016.
DOI : 10.1002/j.1538-7305.1960.tb03936.x

M. C. Golumbic, Algorithmic graph theory and perfect graphs, 2004.

M. C. Golumbic and P. L. Hammer, Stability in circular arc graphs, Journal of Algorithms, vol.9, issue.3, pp.314-320, 1988.
DOI : 10.1016/0196-6774(88)90023-5

F. Harary, R. M. Karp, and W. T. Tutte, A criterion for planarity of the square of a graph, Journal of Combinatorial Theory, vol.2, issue.4, pp.395-405, 1967.
DOI : 10.1016/S0021-9800(67)80050-4

P. Heggernes, Minimal triangulations of graphs: A survey, Discrete Mathematics, vol.306, issue.3, pp.297-317, 2006.
DOI : 10.1016/j.disc.2005.12.003

J. Hopcroft and R. Tarjan, Algorithm 447: efficient algorithms for graph manipulation, Communications of the ACM, vol.16, issue.6, pp.372-378, 1973.
DOI : 10.1145/362248.362272

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, A good characterization of squares of strongly chordal split graphs, Information Processing Letters, vol.111, issue.3, pp.120-123, 2011.
DOI : 10.1016/j.ipl.2010.11.003

V. B. Le and N. N. Tuy, The square of a block graph, Discrete Mathematics, vol.310, issue.4, pp.734-741, 2010.
DOI : 10.1016/j.disc.2009.09.004

H. Leimer, Optimal decomposition by clique separators. Discrete mathematics, pp.99-123, 1993.
DOI : 10.1016/0012-365x(93)90510-z
URL : https://doi.org/10.1016/0012-365x(93)90510-z

K. Lih, W. Wang, and X. Zhu, Coloring the square of a K4-minor free graph, Discrete Mathematics, vol.269, issue.1-3, pp.303-309, 2003.
DOI : 10.1016/S0012-365X(03)00059-1

M. C. Lin, D. Rautenbach, F. J. Soulignac, and J. L. Szwarcfiter, Powers of cycles, powers of paths, and distance graphs, Discrete Applied Mathematics, vol.159, issue.7, pp.621-627, 2011.
DOI : 10.1016/j.dam.2010.03.012

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

E. Lloyd and S. Ramanathan, On the complexity of distance-2 coloring, Proceedings ICCI `92: Fourth International Conference on Computing and Information, pp.71-74, 1992.
DOI : 10.1109/ICCI.1992.227702

M. Milani? and O. Schaudt, Computing square roots of trivially perfect and threshold graphs, Discrete Applied Mathematics, vol.161, issue.10-11, pp.1538-1545, 2013.
DOI : 10.1016/j.dam.2012.12.027

M. Molloy and M. R. Salavatipour, A bound on the chromatic number of the square of a planar graph, Journal of Combinatorial Theory, Series B, vol.94, issue.2, pp.189-213, 2005.
DOI : 10.1016/j.jctb.2004.12.005

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
URL : https://doi.org/10.1016/0166-218x(94)00023-9

A. Mukhopadhyay, The square root of a graph, Journal of Combinatorial Theory, vol.2, issue.3, pp.290-295, 1967.
DOI : 10.1016/S0021-9800(67)80030-9

N. V. Nestoridis and D. M. Thilikos, Square roots of minor closed graph classes, Discrete Applied Mathematics, vol.168, pp.34-39
DOI : 10.1016/j.dam.2013.05.026
URL : https://hal.archives-ouvertes.fr/hal-01083980

A. Oversberg and O. Schaudt, Polynomial time recognition of squares of ptolemaic graphs and 3-sun-free split graphs, WG, pp.360-371, 2014.

A. Parra and P. Scheffler, Characterizations and algorithmic applications of chordal graph embeddings, Discrete Applied Mathematics, vol.79, issue.1-3, pp.171-188, 1997.
DOI : 10.1016/S0166-218X(97)00041-3
URL : https://doi.org/10.1016/s0166-218x(97)00041-3

B. Randerath and L. Volkmann, A characterization of well covered block-cactus graphs, Australas. J. Combin, vol.9, pp.307-314, 1994.

N. Robertson and P. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.
DOI : 10.1016/0196-6774(86)90023-4

I. C. Ross and F. Harary, The square of a tree. The Bell System Technical Journal, pp.641-647, 1960.

R. E. Tarjan, Decomposition by clique separators, Discrete Mathematics, vol.55, issue.2, pp.221-232, 1985.
DOI : 10.1016/0012-365X(85)90051-2
URL : https://doi.org/10.1016/0012-365x(85)90051-2

A. Tucker, Characterizing circular-arc graphs, Bulletin of the American Mathematical Society, vol.76, issue.6, pp.1257-1260, 1970.
DOI : 10.1090/S0002-9904-1970-12628-3
URL : http://www.ams.org/bull/1970-76-06/S0002-9904-1970-12628-3/S0002-9904-1970-12628-3.pdf

G. Wegner, Graphs with given diameter and a coloring problem, 1977.