1. Alon, N., Shapira, A.: Homomorphisms in graph property testing—A survey. Electronic Colloquium on Computational Complexity (ECCC). Report No. 85 (2005)
2. Brooks, R.L.: On coloring the nodes of a network. Math. Proc. Camb. Philos. Soc. 37, 194–197 (1941)
3. Bandelt, H.J., Dress, A.: Reconstructing the shape of a tree from observed dissimilarity data. Adv. Appl. Math. 7, 309–343 (1986)
4. Ben-Dor, A., Chor, B., Graur, D., Ophir, R., Pelleg, D.: From four-taxon trees to phylogenies: the case of mammalian evolution. In: Proceedings of the RECOMB, 1998, pp. 9–19. Also see: constructing phylogenies from quartets: elucidation of eutherian superordinal relationships. J. Comput. Biol. 5, 377–390 (1998)
5. Berry, V., Gascuel, O.: Inferring evolutionary trees with strong combinatorial evidence. Theor. Comput. Sci. 240, 271–298 (2000)