Descendants in increasing trees.
Kuba, Markus, Panholzer, Alois (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kuba, Markus, Panholzer, Alois (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chaudhuri, R., Höft, H. (1991)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Sagan, Bruce E. (2009)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Helen Cameron, Derick Wood (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
H. J. Olivié (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Xavier Messeguer (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Prodinger, Helmut (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Panholzer, Alois, Prodinger, Helmut (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
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.
Woan, Wen-jin, Tankersley, Barbara (2007)
Journal of Integer Sequences [electronic only]
Similarity: