On the distribution of depths in increasing trees.
Kuba, Markus, Wagner, Stephan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kuba, Markus, Wagner, Stephan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
R. Kenyon, C. Kenyon (1992)
Discrete & computational geometry
Similarity:
R.E. Jamison (1987)
Discrete & computational geometry
Similarity:
Alberto Castejón, Mikhail I. Ostrovskii (2009)
Discussiones Mathematicae Graph Theory
Similarity:
The paper is devoted to estimates of the spanning tree congestion for grid graphs and discrete toruses of dimensions two and three.
Ivan Gutman, Yeong-Nan Yeh (1993)
Publications de l'Institut Mathématique
Similarity:
A. Kośliński (1987)
Applicationes Mathematicae
Similarity:
David Aldous, Jim Pitman (1998)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
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.
Sagan, Bruce E. (2009)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Y. Ikebe, M.A. Perles, A. Tamura, S. Tokunaga (1994)
Discrete & computational geometry
Similarity: