M. Abu-ata and F. F. Dragan, Metric tree-like structures in real-life networks : an empirical study, 2014.

S. Arnborg, D. G. Corneil, and A. Proskurowski, -Tree, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.2, pp.277-284, 1987.
DOI : 10.1137/0608024

R. Albert, B. Dasgupta, and N. Mobasheri, Topological implications of negative curvature for biological and social networks, Physical Review E, vol.89, issue.3, p.32811, 2014.
DOI : 10.1103/PhysRevE.89.032811

M. Boguna, F. Papadopoulos, and D. Krioukov, Sustaining the Internet with hyperbolic mapping, Nature Communications, vol.16, issue.6, pp.1-18, 2001.
DOI : 10.1038/ncomms1063

D. Coudert, G. Ducoffe, and N. Nisse, Diameter of minimal separators in graphs, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01088423

. Cgh-+-13-]-p, R. Crescenzi, M. Grossi, L. Habib, A. Lanzi et al., On computing the diameter of real-world undirected graphs [Cou90] B. Courcelle. The monadic second-order logic of graphs. i. recognizable sets of finite graphs, Dourisboure and C. Gavoille. Tree-decompositions with bags of small diameter. Discrete Mathematics, pp.84-9512, 1990.

Y. Dieng and C. Gavoille, On the Tree-Width of Planar Graphs, Electronic Notes in Discrete Mathematics, vol.34, pp.593-596, 2009.
DOI : 10.1016/j.endm.2009.07.099
URL : https://hal.archives-ouvertes.fr/hal-00408481

E. D. Demaine, M. Hajiaghayi, and D. M. Thilikos, The Bidimensional Theory of Bounded-Genus Graphs, Diestel and M. Müller. Connected tree-width, pp.357-371, 2006.
DOI : 10.1137/040616929

F. De-montgolfier, M. Soto, and L. Viennot, Treewidth and Hyperbolicity of the Internet, 2011 IEEE 10th International Symposium on Network Computing and Applications, pp.25-32, 2011.
DOI : 10.1109/NCA.2011.11
URL : https://hal.archives-ouvertes.fr/hal-00909736

U. Feige, M. Hajiaghayi, J. R. Leegro87-]-m, . [. Gromov, J. R. Krauthgamer et al., Improved approximation algorithms for minimum weight vertex separators Hyperbolic groups. Essays in Group Theory Algorithms on negatively curved spaces, Foundations of Computer Science, 2006. FOCS'06. 47th Annual IEEE Symposium onLok09] D. Lokshtanov. Finding the longest isometric cycle in a graph. Discrete Applied Maths, pp.629-65775, 1987.