RésuméOn the set of minimax trees of a given order there can be defined two families of operations, the complements and the reverses. We study the actions of those operations and show that their orbits are enumerated by combinatorial objects previously introduced, such as the Hetyei–Reiner trees, the increasing trees, and the André trees. Various generating functions for those trees by several statistics are also derived
19 pagesInternational audienceAndré proved that the number of alternating permutations on $\{1, 2, \...
International audienceWe introduce new combinatorial objects, the interval- posets, that encode inte...
In this note, we consider the trees (caterpillars) that minimize the number of subtrees among trees ...
AbstractWe study the behavior of the Randić index χ subject to the operation on a tree T which creat...
We provide enumerative results concerning right-to-left minima and left-to-right minima in Andre' p...
The subtrees of a tree have been studied from various points of view. In particular, the extremal tr...
The subtrees of a tree have been studied from various points of view. In particular, the extremal tr...
Leaf-labelled trees are used commonly in computational biology and in other disciplines, to depict t...
Abstract In this paper, we investigate the structures of extremal trees which have the minimal numbe...
This paper is devoted to a systematic study of a class of binary trees encoding the structure of rat...
AbstractWe study that over a certain type of trees (e.g., all trees or all binary trees) with a give...
This thesis in bijective combinatorics focuses on the classical combinatorics classes that are trees...
Dans cette thèse nous étudions des classes d’arbres étiquetés selon différents modèles d’étiquetages...
Consider the set of minimal factorizations of the canonical full cycle in the symmetric group on n +...
This paper is devoted to a systematic study of a class of binary trees encoding the structure of rat...
19 pagesInternational audienceAndré proved that the number of alternating permutations on $\{1, 2, \...
International audienceWe introduce new combinatorial objects, the interval- posets, that encode inte...
In this note, we consider the trees (caterpillars) that minimize the number of subtrees among trees ...
AbstractWe study the behavior of the Randić index χ subject to the operation on a tree T which creat...
We provide enumerative results concerning right-to-left minima and left-to-right minima in Andre' p...
The subtrees of a tree have been studied from various points of view. In particular, the extremal tr...
The subtrees of a tree have been studied from various points of view. In particular, the extremal tr...
Leaf-labelled trees are used commonly in computational biology and in other disciplines, to depict t...
Abstract In this paper, we investigate the structures of extremal trees which have the minimal numbe...
This paper is devoted to a systematic study of a class of binary trees encoding the structure of rat...
AbstractWe study that over a certain type of trees (e.g., all trees or all binary trees) with a give...
This thesis in bijective combinatorics focuses on the classical combinatorics classes that are trees...
Dans cette thèse nous étudions des classes d’arbres étiquetés selon différents modèles d’étiquetages...
Consider the set of minimal factorizations of the canonical full cycle in the symmetric group on n +...
This paper is devoted to a systematic study of a class of binary trees encoding the structure of rat...
19 pagesInternational audienceAndré proved that the number of alternating permutations on $\{1, 2, \...
International audienceWe introduce new combinatorial objects, the interval- posets, that encode inte...
In this note, we consider the trees (caterpillars) that minimize the number of subtrees among trees ...
DOI
Add to ORKG