How to obtain the complete list of caterpillars (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2697, Issue , 2003, Pages 329-338

  Kikuchi, Yosuke ^a   Tanaka, Hiroyuki ^a   Nakano, Shin Ichi ^a   Shibata, Yukio ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CONSTANT TIME; EXTENDED ABSTRACTS; GENERATION ALGORITHM; SIMPLE ALGORITHM;

ARTIFICIAL INTELLIGENCE;

EID: 35248841425     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45071-8_34     Document Type: Article

References (12)

1. Beyer, T. and Hedetiniemi, S. M., Constant Time Generation of Rooted Trees, SIAM J. Comput., 9 (1980) 706-712.
2. Biggs, N. L., Lloyd, E. K., Willson, R. J., Graph Theory 1736-1936, Clarendon Press, Oxford (1976).
3. Chauve, C., Dulucq, S. and Rechnitzer, A., Enumerating Alternating Trees, Journal of Combinatorial Theory, Series A, 94 (2001) 142-151.
4. Chung, K.- L. and Yan, W.- M., On the Number of Spanning Trees of a Multi-Complete/Star Related Graph, Information Processing Letters, 76 (2000) 113-119.
5. Harary, F. and Schwenk, A. J., The Number of Caterpillars, Discrete Mathematics, 6 (1973) 359-365.
6. Hasunuma, T. and Shibata, Y., Counting Small Cycles in Generalized de Bruijn Digraphs, Networks, 29 (1997) 39-47.
7. Li, Z. and Nakano, S., Efficient Generation of Plane Triangulations without Repetitions, Proc. of ICALP 2001, Lecture Notes in Comp. Sci., 2079, (2001) 433-443.
8. Lonc, Z., Parol, K. and Wojciechowski, J. M., On the Number of Spanning Trees in Directed Circulant Graphs, Networks, 37 (2001) 129-133.
9. Nakano, S., Efficient Generation of Plane Trees, Information Processing Letters, 84 (2002) 167-172.
10. Simone, C. D., Lucertini, M., Pallottino, S. and Simeone, B., Fair Dissections of Spiders, Worms, and Caterpillars, Networks, 20 (1990) 323-344.
11. West, D. B., Introduction to Graph Theory, Second Ed., Prentice Hall, NJ (2001)
12. Wright, R. A., Richmond, B., Odlyzko, A. and Mckay, B. D., Constant Time Generation of Free Tree, SIAM J. Comput., 15 (1986) 540-548.