Intersection graphs of trees and tree algebras
Intersections of randomly embedded sparse graphs are Poisson.
Inversion of integral series enumerating planar trees.
Isolated trees in a bichromatic random graph
Isolated trees in a random graph
Isomorphisms and traversability of directed path graphs
The concept of a line digraph is generalized to that of a directed path graph. The directed path graph Pₖ(D) of a digraph D is obtained by representing the directed paths on k vertices of D by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in D form a directed path on k+1 vertices or form a directed cycle on k vertices in D. In this introductory paper several properties of P₃(D) are studied, in particular with respect to isomorphism and traversability. In our...
Ještě o kostrách souvislých grafů
Join graphs of trees
Kernels and Grundy functions on trees. (Kerne und Grundyfunktionen auf Bäumen.)
K-параметрическая задача Ламе на графах
La comparaison des hiérarchies : indices et métriques
Large bounded degree trees in expanding graphs.
Large deviations of Markov chains indexed by random trees
Large trees in random graphs
Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences.
Le traitement des ex æquo en analyse de similitude : la réunion des arbres maximaux ou RAM
On considère un graphe complet dont les arêtes sont totalement préordonnées. En analyse de similitude, plutôt que de procéder à un ordonnancement des arêtes ex oequo par une méthode lexicographique sur leurs intitulés, l'auteur propose de rechercher la réunion des arbres maximaux (RAM).
Les arbres et les indices de centralité et de compacité de P. Parlebas
Les hiérarchies de parties et leur demi-treillis
Limit distributions and random trees derived from the birthday problem with unequal probabilities.
Limit distributions for queues and random rooted trees.