Dessins d'enfants and hubbard trees
Kevin M. Pilgrim (2000)
Annales scientifiques de l'École Normale Supérieure
Similarity:
Displaying similar documents to “Conservative polynomials and yet another action of on plane trees”
Dessins d'enfants and hubbard trees
On the rules for the elimination of the non-canonical Morgan trees
Damir Vukičević (2009)
Kragujevac Journal of Mathematics
Similarity:
Hubbard trees
Alfredo Poirier (2010)
Fundamenta Mathematicae
Similarity:
We provide a full classification of postcritically finite polynomials as dynamical systems by means of Hubbard trees. The information encoded in these objects is solid enough to allow us recover all the relevant statical and dynamical aspects of the corresponding Julia sets.
Distances between rooted trees
Bohdan Zelinka (1991)
Mathematica Bohemica
Similarity:
Two types of a distance between isomorphism classes of graphs are adapted for rooted trees.
Complexes of Directed Trees of Complete Multipartite Graphs
Duško Jojić (2012)
Publications de l'Institut Mathématique
Similarity:
Combinatorial interpretation of generalized Stirling numbers.
Lang, Wolfdieter (2009)
Journal of Integer Sequences [electronic only]
Similarity:
On some polynomial solvable cases of the generalized minimum spanning tree problem.
Pop, Petrică Claudiu (2005)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Determination of Large Families and Diameter of Equiseparable Trees
Zoran Stanić (2006)
Publications de l'Institut Mathématique
Similarity:
The triangles method to build -trees from incomplete distance matrices
Alain Guénoche, Bruno Leclerc (2001)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A method to infer -trees (valued trees having as set of leaves) from incomplete distance arrays (where some entries are uncertain or unknown) is described. It allows us to build an unrooted tree using only 2-3 distance values between the elements of , if they fulfill some explicit conditions. This construction is based on the mapping between -tree and a weighted generalized 2-tree spanning .