@article(AdlNowAhr11,
 author       = {Ahmadi-Adl, A. and Nowzari-Dalini, A. and H. Ahrabian},
 year         = {2011},
 title        = {Ranking and unranking algorithms for loopless generation of t-ary trees},
 journal      = {Logic Journal of IGPL},
 volume       = {19},
 number       = {1},
 pages        = {33--43},
 doi          = {10.1093/jigpal/jzp097},
)
@article(AhNo98,
 author       = {H. Ahrabian and Nowzari-Dalini, A.},
 year         = {1998},
 title        = {On the generation of binary trees from (0--1) codes},
 journal      = {International journal of computer mathematics},
 volume       = {69},
 number       = {3-4},
 pages        = {243--251},
 doi          = {10.1080/00207169808804721},
)
@article(ahno99,
 author       = {H. Ahrabian and Nowzari-Dalini, A.},
 year         = {1999},
 title        = {On the generation of binary trees in A-order},
 journal      = {International journal of computer mathematics},
 volume       = {71},
 number       = {3},
 pages        = {351--357},
 doi          = {10.1080/00207169908804813},
)
@article(ahno05,
 author       = {H. Ahrabian and Nowzari-Dalini, A.},
 year         = {2005},
 title        = {Parallel generation of binary trees in A-order},
 journal      = {Parallel Computing},
 volume       = {31},
 number       = {8},
 pages        = {948--955},
 doi          = {10.1016/j.parco.2005.06.002},
)
@article(Ari03,
 author       = {R. Aringhieri and P. Hansen and F. Malucelli},
 year         = {2003},
 title        = {Chemical trees enumeration algorithms},
 journal      = {Quarterly Journal of the Belgian, French and Italian Operations Research Societies},
 volume       = {1},
 number       = {1},
 pages        = {67--83},
 doi          = {10.1007/s10288-002-0008-9},
)
@article(Bal92,
 author       = {T. S. Balaban and P. A. Filip and O. Ivanciuc},
 year         = {1992},
 title        = {Computer generation of acyclic graphs based on local vertex invariants and topological indices. Derived canonical labelling and coding of trees and alkanes},
 journal      = {Journal of Mathematical Chemistry},
 volume       = {11},
 number       = {1},
 pages        = {79--105},
 doi          = {10.1007/BF01164196},
)
@article(Bey80,
 author       = {T. Beyer and S. M. Hedetniemi},
 year         = {1980},
 title        = {Constant time generation of rooted trees},
 journal      = {SIAM Journal on Computing},
 volume       = {9},
 number       = {4},
 pages        = {706--712},
 doi          = {10.1137/0209055},
)
@article(CapGut99,
 author       = {G. Caporossi and I. Gutman and P. Hansen},
 year         = {1999},
 title        = {Variable Neighborhood Search for Extremal Graphs: {IV:} Chemical Trees with Extremal Connectivity Index},
 journal      = {Computers {\&} Chemistry},
 volume       = {23},
 number       = {5},
 pages        = {469--477},
 doi          = {10.1016/S0097-8485(99)00031-5},
)
@article(DobGut99,
 author       = {A. A. Dobrynin and I. Gutman},
 year         = {1999},
 title        = {The Average Wiener Index of Trees and Chemical Trees},
 journal      = {Journal of Chemical Information and Computer Sciences},
 volume       = {39},
 number       = {4},
 pages        = {679--683},
 doi          = {10.1021/ci980158r},
)
@article(er92,
 author       = {M. C. Er},
 year         = {1992},
 title        = {Efficient generation of k-ary trees in natural order},
 journal      = {The Computer Journal},
 volume       = {35},
 number       = {3},
 pages        = {306--308},
 doi          = {10.1093/comjnl/35.3.306},
)
@article(Fuj08,
 author       = {H. Fujiwara and J. Wang and L. Zhao and H. Nagamochi and T. Akutsu},
 year         = {2008},
 title        = {Enumerating Treelike Chemical Graphs with Given Path Frequency},
 journal      = {Journal of Chemical Information and Modeling},
 volume       = {48},
 number       = {7},
 pages        = {1345--1357},
 doi          = {10.1021/ci700385a},
)
@inbook(Gut87,
 author       = {I. Gutman},
 year         = {1987},
 title        = {Graphs and graph polynomials of interest in chemistry},
 pages        = {177--187},
 publisher    = {Springer Berlin Heidelberg},
 doi          = {10.1007/3-540-17218-1},
)
@article(Gut95,
 author       = {I. Gutman and P. Hansen and H. M{\'{e}}lot},
 year         = {2005},
 title        = {Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees},
 journal      = {Journal of Chemical Information and Modeling},
 volume       = {45},
 number       = {2},
 pages        = {222--230},
 doi          = {10.1021/ci0342775},
)
@book(Gut86,
 author       = {I. Gutman and O. E. Polansky},
 year         = {1986},
 title        = {Mathematical concepts in organic chemistry},
 publisher    = {Springer Berlin Heidelberg},
 doi          = {10.1007/978-3-642-70982-1},
)
@article(Han94,
 author       = {P. Hansen and B. Jaumard and C. Lebatteux and M. Zheng},
 year         = {1994},
 title        = {Coding Chemical Trees with the Centered N-tuple Code},
 journal      = {Journal of Chemical Information and Computer Sciences},
 volume       = {34},
 number       = {4},
 pages        = {782--790},
 doi          = {10.1021/ci00020a010},
)
@article(Hen91,
 author       = {J. B. Hendrickson and C. A. Parks},
 year         = {1991},
 title        = {Generation and enumeration of carbon skeletons},
 journal      = {Journal of Chemical Information and Computer Sciences},
 volume       = {31},
 number       = {1},
 pages        = {101--107},
 doi          = {10.1021/ci00001a018},
)
@article(HeuLiMan08,
 author       = {S. Heubach and N. Y. Li and T. Mansour},
 year         = {2008},
 title        = {Staircase tilings and k-Catalan structures},
 journal      = {Discrete Mathematics},
 volume       = {308},
 number       = {24},
 pages        = {5954--5964},
 doi          = {10.1016/j.disc.2007.11.012},
)
@article(kor05,
 author       = {J. F Korsh},
 year         = {2005},
 title        = {Generating t-ary trees in linked representation},
 journal      = {The Computer Journal},
 volume       = {48},
 number       = {4},
 pages        = {488--497},
 doi          = {10.1093/comjnl/bxh110},
)
@article(korlaf99,
 author       = {J. F. Korsh and P. LaFollette},
 year         = {1999},
 title        = {Loopless generation of Gray codes for k-ary trees},
 journal      = {Information processing letters},
 volume       = {70},
 number       = {1},
 pages        = {7--11},
 doi          = {10.1016/S0020-0190(99)00035-6},
)
@article(Gut98,
 author       = {M. Lepovic and I. Gutman},
 year         = {1998},
 title        = {A collective property of trees and chemical trees},
 journal      = {Journal of chemical information and computer sciences},
 volume       = {38},
 number       = {5},
 pages        = {823--826},
 doi          = {10.1021/ci980004b},
)
@article(li86,
 author       = {L. Li},
 year         = {1986},
 title        = {Ranking and unranking of AVL-trees},
 journal      = {SIAM Journal on Computing},
 volume       = {15},
 number       = {4},
 pages        = {1025--1035},
 doi          = {10.1137/0215073},
)
@article(luroru93,
 author       = {J. M. Lucas and D. R. Vanbaronaigien and F. Ruskey},
 year         = {1993},
 title        = {On rotations and the generation of binary trees},
 journal      = {Journal of Algorithms},
 volume       = {15},
 number       = {3},
 pages        = {343--366},
 doi          = {10.1006/jagm.1993.1045},
)
@inproceedings(Nak04,
 author       = {S. Nakano and T. Uno},
 year         = {2005},
 title        = {Constant time generation of trees with specified diameter},
 booktitle    = {30th International Workshop on Graph-Theoretic Concepts in Computer Science},
 organization = {Springer},
 pages        = {33--45},
 doi          = {10.1007/978-3-540-30559-03},
)
@article(pa87,
 author       = {J. M. Pallo},
 year         = {1987},
 title        = {Generating trees with n nodes and m leaves},
 journal      = {International journal of computer mathematics},
 volume       = {21},
 number       = {2},
 pages        = {133--144},
 doi          = {10.1080/00207168708803562},
)
@article(Pal90,
 author       = {J. M. Pallo},
 year         = {1990},
 title        = {A simple algorithm for generating neuronal dendritic trees},
 journal      = {Computer methods and programs in biomedicine},
 volume       = {33},
 number       = {3},
 pages        = {165--169},
 doi          = {10.1016/0169-2607(90)90038-B},
)
@article(para85,
 author       = {J. M. Pallo and R. Racca},
 year         = {1985},
 title        = {A note on generating binary trees in A-order and B-order},
 journal      = {International Journal of Computer Mathematics},
 volume       = {18},
 number       = {1},
 pages        = {27--39},
 doi          = {10.1080/00207168508803477},
)
@article(ru78,
 author       = {F. Ruskey},
 year         = {1978},
 title        = {Generating t-ary trees lexicographically},
 journal      = {SIAM Journal on Computing},
 volume       = {7},
 number       = {4},
 pages        = {424--439},
 doi          = {10.1137/0207034},
)
@article(TabAhrNow10,
 author       = {Seyedi-Tabari, E. and H. Ahrabian and Nowzari-Dalini, A.},
 year         = {2010},
 title        = {A new algorithm for generation of different types of RNA},
 journal      = {International Journal of Computer Mathematics},
 volume       = {87},
 number       = {6},
 pages        = {1197--1207},
 doi          = {10.1080/00207160802140049},
)
@article(Shi11,
 author       = {M. Shimizu and H. Nagamochi and T. Akutsu},
 year         = {2011},
 title        = {Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies},
 journal      = {{BMC} Bioinformatics},
 volume       = {12},
 number       = {14},
 pages        = {1--9},
 doi          = {10.1186/1471-2105-12-S14-S3},
)
@article(vapa94,
 author       = {V. Vajnovszki and J. M. Pallo},
 year         = {1994},
 title        = {Generating binary trees in A-order from codewords defined on a four-letter alphabet},
 journal      = {Journal of Information and Optimization Sciences},
 volume       = {15},
 number       = {3},
 pages        = {345--357},
 doi          = {10.1080/02522667.1994.10699193},
)
@article(vapa97,
 author       = {V. Vajnovszki and J. M. Pallo},
 year         = {1997},
 title        = {Ranking and unranking k-ary trees with a 4 k-4 letter alphabet},
 journal      = {Journal of Information and Optimization Sciences},
 volume       = {18},
 number       = {2},
 pages        = {271--279},
 doi          = {10.1080/02522667.1997.10699333},
)
@article(Wil89,
 author       = {H. S. Wilf and N. A. Yoshimura},
 year         = {1989},
 title        = {Ranking rooted trees, and a graceful application},
 journal      = {Annals of the New York Academy of Sciences},
 volume       = {576},
 number       = {1},
 pages        = {633--640},
 doi          = {10.1111/j.1749-6632.1989.tb16444.x},
)
@article(Will98,
 author       = {P. Willett and J. M. Barnard and G. M. Downs},
 year         = {1998},
 title        = {Chemical similarity searching},
 journal      = {Journal of chemical information and computer sciences},
 volume       = {38},
 number       = {6},
 pages        = {983--996},
 doi          = {10.1021/ci9800211},
)
@article(Wri09,
 author       = {R. A. Wright and B. Richmond and A. Odlyzko and B. D. McKay},
 year         = {1986},
 title        = {Constant time generation of free trees},
 journal      = {SIAM Journal on Computing},
 volume       = {15},
 number       = {2},
 pages        = {540--548},
 doi          = {10.1137/0215039},
)
@article(WuChaCha11,
 author       = {R. Wu and J. Chang and C. Chang},
 year         = {2011},
 title        = {Ranking and unranking of non-regular trees with a prescribed branching sequence},
 journal      = {Mathematical and Computer Modelling},
 volume       = {53},
 number       = {5},
 pages        = {1331--1335},
 doi          = {10.1016/j.mcm.2010.12.019},
)
@article(wuchawan06,
 author       = {R. Wu and J. Chang and Y. Wang},
 year         = {2006},
 title        = {A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations},
 journal      = {Theoretical Computer Science},
 volume       = {355},
 number       = {3},
 pages        = {303--314},
 doi          = {10.1016/j.tcs.2006.01.022},
)
@article(xiaushtan01,
 author       = {L. Xiang and K. Ushijima and C. Tang},
 year         = {2001},
 title        = {On generating k-ary trees in computer representation},
 journal      = {Information processing letters},
 volume       = {77},
 number       = {5},
 pages        = {231--238},
 doi          = {10.1016/S0020-0190(00)00155-1},
)
@incollection(Yam09,
 author       = {K. Yamanaka and Y. Otachi and S. Nakano},
 year         = {2009},
 title        = {Efficient enumeration of ordered trees with k leaves},
 booktitle    = {WALCOM: Algorithms and Computation},
 publisher    = {Springer},
 pages        = {141--150},
 doi          = {10.1016/j.tcs.2011.01.017},
)
@article(za80,
 author       = {S. Zaks},
 year         = {1980},
 title        = {Lexicographic generation of ordered trees},
 journal      = {Theoretical Computer Science},
 volume       = {10},
 number       = {1},
 pages        = {63--82},
 doi          = {10.1016/0304-3975(80)90073-0},
)
@inproceedings(Zhu10,
 author       = {B. Zhuang and H. Nagamochi},
 year         = {2010},
 title        = {Constant Time Generation of Trees with Degree Bounds},
 booktitle    = {9th International Symposium on Operations Research and Its Applications},
 pages        = {183--194},
 doi          = {10.1.1.385.6436},
)