### On A-Trees

Đuro Kurepa (1968)

Publications de l'Institut Mathématique

Similarity:

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Đuro Kurepa (1968)

Publications de l'Institut Mathématique

Similarity:

Rimlinger, Frank (1992)

Experimental Mathematics

Similarity:

D. Kurepa (1977)

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

Similarity:

Z. A. Łomnicki (1973)

Applicationes Mathematicae

Similarity:

Ivan Gutman, Yeong-Nan Yeh (1993)

Publications de l'Institut Mathématique

Similarity:

Stevo Todorčević (1980)

Publications de l'Institut Mathématique

Similarity:

A. Kośliński (1987)

Applicationes Mathematicae

Similarity:

Masayoshi Matsushita, Yota Otachi, Toru Araki (2015)

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...

Rains, E.M., Sloane, N.J.A. (1999)

Journal of Integer Sequences [electronic only]

Similarity:

Keh-Hsun Chen, Zbigniew W. Ras (1988)

Banach Center Publications

Similarity:

Damir Vukičević (2009)

Kragujevac Journal of Mathematics

Similarity:

Damian Bogdanowicz, Krzysztof Giaro (2013)

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,...

F.A. Muntaner-Batle, Miquel Rius-Font (2008)

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.

Damian Bogdanowicz (2011)

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...