Descents in noncrossing trees.
Hough, David S. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Hough, David S. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zoran Stanić (2006)
Publications de l'Institut Mathématique
Similarity:
Bernardi, Olivier (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Callan, David (2003)
Journal of Integer Sequences [electronic only]
Similarity:
Damir Vukičević (2009)
Kragujevac Journal of Mathematics
Similarity:
Schaeffer, Gilles (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bohdan Zelinka (1991)
Mathematica Bohemica
Similarity:
Two types of a distance between isomorphism classes of graphs are adapted for rooted trees.
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 .
Mészáros, Karola (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Alameddine, A.F. (1991)
International Journal of Mathematics and Mathematical Sciences
Similarity: