论文信息 - How to Obtain the Complete List of Caterpillars (Extended Abstract)

How to Obtain the Complete List of Caterpillars (Extended Abstract)

We propose a simple algorithm to generate all caterpillars without repetition. Also some other generation algorithms are presented. Our algorithm generates each caterpillar in a constant time per caterpillar.

Yukio Shibata | Shin-Ichi Nakano | Hiroyuki Tanaka | Yosuke Kikuchi

[1] Shin-Ichi Nakano,et al. Efficient Generation of Plane Triangulations without Repetitions , 2001, ICALP.

[2] Yukio Shibata,et al. Counting small cycles in generalized de Bruijn digraphs , 1997 .

[3] Zbigniew Lonc,et al. On the number of spanning trees in directed circulant graphs , 2001, Networks.

[4] D. West. Introduction to Graph Theory , 1995 .

[5] N. Biggs,et al. Graph Theory 1736-1936 , 1976 .

[6] Caterina De Simone,et al. Fair dissections of spiders, worms, and caterpillars , 1990, Networks.

[7] Cédric Chauve,et al. Enumerating Alternating Trees , 2001, J. Comb. Theory, Ser. A.

[8] Sandra Mitchell Hedetniemi,et al. Constant Time Generation of Rooted Trees , 1980, SIAM J. Comput..

[9] Frank Harary,et al. The number of caterpillars , 1973, Discret. Math..

[10] Kuo-Liang Chung,et al. On the number of spanning trees of a multi-complete/star related graph , 2000, Inf. Process. Lett..

[11] Shin-Ichi Nakano,et al. Efficient generation of plane trees , 2002, Inf. Process. Lett..

[12] Brendan D. McKay,et al. Constant Time Generation of Free Trees , 1986, SIAM J. Comput..