## Displaying similar documents to “Some Results on Maps That Factor through a Tree”

### Analyzing sets of phylogenetic trees using metrics

Applicationes Mathematicae

Similarity:

The reconstruction of evolutionary trees is one of the primary objectives in phylogenetics. Such a tree represents historical evolutionary relationships between different species or organisms. Tree comparisons are used for multiple purposes, from unveiling the history of species to deciphering evolutionary associations among organisms and geographical areas. In this paper, we describe a general method for comparing phylogenetic trees and give some basic properties of the Matching Split...

### Deducing Properties of Trees From Their Matula Numbers

Publications de l'Institut Mathématique

Similarity:

### On the normal disconnection of a tree

Applicationes Mathematicae

Similarity:

### On a matching distance between rooted phylogenetic trees

International Journal of Applied Mathematics and Computer Science

Similarity:

The Robinson-Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach based on a minimum-weight perfect matching in bipartite graphs,...

### Completely Independent Spanning Trees in (Partial) k-Trees

Discussiones Mathematicae Graph Theory

Similarity:

Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint. For a graph G, we denote the maximum number of pairwise completely independent spanning trees by cist(G). In this paper, we consider cist(G) when G is a partial k-tree. First we show that [k/2] ≤ cist(G) ≤ k − 1 for any k-tree G. Then we show that for any p ∈ {[k/2], . . . , k − 1}, there exist infinitely many k-trees G such...

### An axiomatic theory of information trees

Banach Center Publications

Similarity:

### On the structure of path-like trees

Discussiones Mathematicae Graph Theory

Similarity:

We study the structure of path-like trees. In order to do this, we introduce a set of trees that we call expandable trees. In this paper we also generalize the concept of path-like trees and we call such generalization generalized path-like trees. As in the case of path-like trees, generalized path-like trees, have very nice labeling properties.

### On A-Trees

Publications de l'Institut Mathématique

Similarity:

### On the rules for the elimination of the non-canonical Morgan trees

Kragujevac Journal of Mathematics

Similarity:

### On some hypotheses concerning trees.

Publications de l'Institut Mathématique [Elektronische Ressource]

Similarity:

### The triangles method to build $X$-trees from incomplete distance matrices

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A method to infer $X$-trees (valued trees having $X$ 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$n$-3 distance values between the $n$ elements of $X$, if they fulfill some explicit conditions. This construction is based on the mapping between $X$-tree and a weighted generalized 2-tree spanning $X$.

### Some remarks on the enumeration of rooted trees

Applicationes Mathematicae

Similarity: