P. S. Almeida, C. Baquero, and A. Cunha, Fast distributed computation of distances in networks, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC), 2011.
DOI : 10.1109/CDC.2012.6426872

G. Chartrand and S. F. Kapoor, The cube of every connected graph is 1-hamiltonian, Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences, vol.73, issue.1, pp.47-48, 1969.
DOI : 10.6028/jres.073B.007

S. [. Frischknecht, R. Holzer, and . Wattenhofer, Networks Cannot Compute Their Diameter in Sublinear Time, SODA, pp.1150-1162, 2012.
DOI : 10.1137/1.9781611973099.91

A. [. Harary and . Schwenk, Trees with Hamiltonian square, Mathematika, vol.89, issue.01, pp.138-140, 1971.
DOI : 10.1112/S0025579300008494

R. [. Holzer and . Wattenhofer, Optimal distributed all pairs shortest paths and applications, Proceedings of the 2012 ACM symposium on Principles of distributed computing, PODC '12, pp.355-364, 2012.
DOI : 10.1145/2332432.2332504

J. [. Métivier, A. Robson, and . Zemmari, A distributed enumeration algorithm and applications to all pairs shortest paths, diameter???, Information and Computation, vol.247, pp.141-151, 2016.
DOI : 10.1016/j.ic.2015.12.004

L. [. Peleg, E. Roditty, and . Tal, Distributed Algorithms for Network Diameter and Girth, pp.660-672, 2012.
DOI : 10.1007/978-3-642-31585-5_58

J. Radoszewski and W. Rytter, Hamiltonian Paths in the Square of a Tree, ISAAC, pp.90-99, 2011.
DOI : 10.1007/978-3-642-25591-5_11

M. Sekanina, On an algorithm for ordering of graphs, Bulletin canadien de math??matiques, vol.14, issue.0, pp.221-224, 1971.
DOI : 10.4153/CMB-1971-037-7