E. Bapteste, M. O. Malley, R. Beiko, M. Ereshefsky, J. P. Gogarten et al., Prokaryotic evolution and the tree of life are two different things, Biology Direct, vol.4, issue.1, p.34, 2009.
DOI : 10.1186/1745-6150-4-34

E. Bibelnieks and P. M. Dearing, Neighborhood subtree tolerance graphs, Discrete Applied Mathematics, vol.43, issue.1, pp.13-26, 1993.
DOI : 10.1016/0166-218X(93)90165-K
URL : http://doi.org/10.1016/0166-218x(93)90165-k

A. Brandstädt, On leaf powers, 2010.

A. Brandstädt and C. Hundt, Ptolemaic Graphs and Interval Graphs Are Leaf Powers, LATIN 2008: Theoretical Informatics, pp.479-491, 2008.
DOI : 10.1007/978-3-540-78773-0_42

A. Brandstädt, C. Hundt, F. Mancini, and P. Wagner, Rooted directed path graphs are leaf powers, Discrete Mathematics, vol.310, issue.4, pp.897-910, 2010.
DOI : 10.1016/j.disc.2009.10.006

A. Brandstädt and V. B. Le, Structure and linear time recognition of 3-leaf powers, Information Processing Letters, vol.98, issue.4, pp.133-138, 2006.
DOI : 10.1016/j.ipl.2006.01.004

A. Brandstädt, V. B. Le, and D. Rautenbach, A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers, Discrete Mathematics, vol.309, issue.12, pp.3843-3852, 2009.
DOI : 10.1016/j.disc.2008.10.025

A. Brandstädt, V. B. Le, and D. Rautenbach, Exact leaf powers, Theoretical Computer Science, vol.411, issue.31-33, pp.31-332968, 2010.
DOI : 10.1016/j.tcs.2010.04.027

A. Brandstädt, V. B. Le, and J. Spinrad, Graph Classes: A Survey, Society for Industrial and Applied Mathematics, 1999.
DOI : 10.1137/1.9780898719796

A. Brandstädt, V. B. Le, and R. Sritharan, Structure and linear-time recognition of 4-leaf powers, ACM Trans. Algorithms, vol.511, issue.1, pp.1-1122, 2008.

A. Brandstädt and P. Wagner, On k- Versus (k???+???1)-Leaf Powers, Combinatorial Optimization and Applications, pp.171-179, 2008.
DOI : 10.1007/978-3-540-85097-7_16

A. Brandstädt and P. Wagner, The complete inclusion structure of leaf power classes, Theoretical Computer Science, vol.410, pp.5505-5514, 2009.

T. Calamoneri, A. Frangioni, and B. Sinaimeri, Pairwise Compatibility Graphs of Caterpillars, The Computer Journal, vol.57, issue.11, pp.1616-1623, 2014.
DOI : 10.1093/comjnl/bxt068
URL : http://eprints.adm.unipi.it/2305/1/TR%2D13%2D09.pdf.gz

T. Calamoneri, D. Frascaria, and B. Sinaimeri, All Graphs with at Most Seven Vertices are Pairwise Compatibility Graphs, The Computer Journal, vol.56, issue.7, pp.882-886, 2013.
DOI : 10.1093/comjnl/bxs087
URL : http://arxiv.org/abs/1202.4631

T. Calamoneri, M. Gastaldello, and B. Sinaimeri, On pairwise compatibility of some graph (super)classes, 2015.

T. Calamoneri, E. Montefusco, R. Petreschi, and B. Sinaimeri, Exploring pairwise compatibility graphs, Theoretical Computer Science, vol.468, pp.23-26, 2013.
DOI : 10.1016/j.tcs.2012.11.015

T. Calamoneri and R. Petreschi, On pairwise compatibility graphs having Dilworth number two, Theoretical Computer Science, vol.524, pp.34-40, 2013.
DOI : 10.1016/j.tcs.2013.12.015

T. Calamoneri and R. Petreschi, On pairwise compatibility graphs having Dilworth number k, Theoretical Computer Science, vol.547, pp.82-89, 2014.
DOI : 10.1016/j.tcs.2014.06.024

T. Calamoneri and R. Petreschi, On pairwise compatibility graphs having Dilworth number two, Theoretical Computer Science, vol.524, pp.34-40, 2014.
DOI : 10.1016/j.tcs.2013.12.015

T. Calamoneri, R. Petreschi, and B. Sinaimeri, On Relaxing the Constraints in Pairwise Compatibility Graphs, WALCOM: Algorithms and Computation, pp.124-135, 2012.
DOI : 10.1007/978-3-642-28076-4_14

T. Calamoneri, R. Petreschi, and B. Sinaimeri, ON THE PAIRWISE COMPATIBILITY PROPERTY OF SOME SUPERCLASSES OF THRESHOLD GRAPHS, Discrete Mathematics, Algorithms and Applications, vol.56, issue.02, p.51360002, 2013.
DOI : 10.1007/s12190-008-0204-7

T. Calamoneri and B. Sinaimeri, Relating threshold tolerance graphs to other graph classes, Proceedings of the 15th Italian Conference on Theoretical Computer Science, pp.73-79, 2014.

M. Chang and M. Ko, The 3-Steiner Root Problem, Lecture Notes in Computer Science, vol.4769, pp.109-120, 2007.
DOI : 10.1007/978-3-540-74839-7_11

Z. Chen, T. Jiang, and G. Lin, Computing Phylogenetic Roots with Bounded Degrees and Errors, SIAM Journal on Computing, vol.32, issue.4, pp.864-879, 2003.
DOI : 10.1137/S0097539701389154
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.6707

V. Chvatal and P. L. Hammer, Aggregation of Inequalities in Integer Programming, Studies in Integer Programming26] H.N. de Ridder et al. Information System on Graph Classes and their Inclusions(ISGCI), pp.145-162, 1977.
DOI : 10.1016/S0167-5060(08)70731-3

R. P. Dilworth, A Decomposition Theorem for Partially Ordered Sets, The Annals of Mathematics, vol.51, issue.1, pp.161-166, 1950.
DOI : 10.2307/1969503

M. Dom, J. Guo, F. Hüffner, and R. Niedermeier, Error Compensation in Leaf Root Problems, Algorithms and Computation, pp.389-401, 2005.
DOI : 10.1007/978-3-540-30551-4_35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.6472

M. Dom, J. Guo, F. Hüffner, and R. Niedermeier, Extending the Tractability Border for Closest Leaf Powers, Lecture Notes in Computer Science, vol.3787, pp.397-408, 2005.
DOI : 10.1007/11604686_35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.490

S. Durocher, D. Mondal, and M. S. Rahman, On graphs that are not PCGs, Theoretical Computer Science, 2015.
DOI : 10.1007/978-3-642-36065-7_29

M. Farber, Characterizations of strongly chordal graphs, Discrete Mathematics, vol.43, issue.2-3, pp.173-189, 1983.
DOI : 10.1016/0012-365X(83)90154-1

J. Felsenstein, Cases in which Parsimony or Compatibility Methods Will be Positively Misleading, Systematic Zoology, vol.27, issue.4, pp.401-410, 1978.
DOI : 10.2307/2412923

S. Földes and P. L. Hammer, Split graphs. 8th South?Eastern Conf, Louisiana StateUniv. Baton Rouge, pp.311-315, 1977.

F. Gavril, A recognition algorithm for the intersection graphs of directed paths in directed trees, Discrete Mathematics, vol.13, issue.3, pp.237-249, 1975.
DOI : 10.1016/0012-365X(75)90021-7

M. C. Golumbic, C. L. Monma, and W. T. Trotter, Tolerance graphs, Discrete Applied Mathematics, vol.9, issue.2, pp.157-170, 1984.
DOI : 10.1016/0166-218X(84)90016-7

F. Harary and A. J. Schwenk, The number of caterpillars, Discrete Mathematics, vol.6, issue.4, pp.359-365, 1973.
DOI : 10.1016/0012-365X(73)90067-8

R. B. Hayward, P. E. Kearney, and A. Malton, NeST graphs, Discrete Applied Mathematics, vol.121, issue.1-3, pp.1-3139, 2002.
DOI : 10.1016/S0166-218X(01)00207-4
URL : http://doi.org/10.1016/s0166-218x(01)00207-4

B. Jamison and S. Olariu, Recognizing $P_4 $-Sparse Graphs in Linear Time, SIAM Journal on Computing, vol.21, issue.2, pp.381-406, 1992.
DOI : 10.1137/0221027

P. E. Kearney, J. I. Munro, and D. Phillips, Efficient Generation of Uniform Samples from Phylogenetic Trees, Algorithms in Bioinformatics Lecture Notes in Computer Science, vol.2812, pp.177-189, 2003.
DOI : 10.1007/978-3-540-39763-2_14

F. J. Lapointe, P. Lopez, Y. Boucher, J. Koenig, and E. Bapteste, Clanistics: a multi-level perspective for harvesting unrooted gene trees, Trends in Microbiology, vol.18, issue.8, pp.341-347, 2010.
DOI : 10.1016/j.tim.2010.03.009

G. Lin, P. E. Kearney, T. Jiang, D. T. Lee, and S. , Phylogenetic k-Root and Steiner k-Root, Algorithms and Computation, pp.539-551, 1969.
DOI : 10.1007/3-540-40996-3_46
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.3974

N. V. Mahadev and U. N. Peled, Threshold graphs and related topics, Annals of Discrete Mathematics, 1995.

S. Mehnaz and M. S. Rahman, Pairwise compatibility graphs revisited, 2013 International Conference on Informatics, Electronics and Vision (ICIEV), pp.1-6, 2013.
DOI : 10.1109/ICIEV.2013.6572681

C. L. Monma, B. Reed, and W. T. Trotter-jr, A generalization of threshold graphs with tolerance, Congressus Numerantium, vol.55, pp.187-197, 1986.

C. L. Monma, B. Reed, and W. T. Trotter-jr, Threshold tolerance graphs, Journal of Graph Theory, vol.2, issue.3, pp.343-362, 1988.
DOI : 10.1002/jgt.3190120307

R. Nevries and C. Rosenke, Towards a Characterization of Leaf Powers by Clique Arrangements, SOFSEM 2015: Theory and Practice of Computer Science, pp.364-376, 2015.
DOI : 10.1007/978-3-662-46078-8_30

N. Nishimura, P. Ragde, and D. M. Thilikos, On Graph Powers for Leaf-Labeled Trees, Journal of Algorithms, vol.42, issue.1, pp.69-108, 2002.
DOI : 10.1006/jagm.2001.1195
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.5320

D. Phillips, Uniform sampling from phylogenetic trees. Master Degree -Univ, 2002.

D. Rautenbach, Some remarks about leaf roots, Discrete Mathematics, vol.306, issue.13, pp.1456-1461, 2006.
DOI : 10.1016/j.disc.2006.03.030
URL : http://doi.org/10.1016/j.disc.2006.03.030

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

D. Mondal, S. Durocher, and M. S. Rahman, On graphs that are not pcgs, WALCOM: Algorithms and Computation, pp.310-321, 2013.

S. A. Salma, M. S. Rahman, and M. I. Hossain, Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs, Journal of Graph Algorithms and Applications, vol.17, issue.2, pp.81-102, 2013.
DOI : 10.7155/jgaa.00286

R. Tyshkevich, Decomposition of graphical sequences and unigraphs, Discrete Mathematics, vol.220, issue.1-3, pp.201-238, 2000.
DOI : 10.1016/S0012-365X(99)00381-7
URL : http://doi.org/10.1016/s0012-365x(99)00381-7

M. N. Yanhaona, M. S. Bayzid, and M. S. Rahman, Discovering pairwise compatibility graphs, Discrete Math., Alg. and Appl, vol.2, issue.4, pp.607-624, 2010.

M. N. Yanhaona, K. S. Hossain, and M. S. Rahman, Pairwise compatibility graphs, Journal of Applied Mathematics and Computing, vol.29, issue.1, pp.479-503, 2009.
DOI : 10.1007/s12190-008-0204-7