Skip to main content
SpringerLink
Log in

How to Obtain the Complete List of Caterpillars

Extended Abstract

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2697))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beyer, T. and Hedetiniemi, S. M., Constant Time Generation of Rooted Trees, SIAM J. Comput., 9 (1980) 706–712.

    Article  MATH  MathSciNet  Google Scholar 

  2. Biggs, N. L., Lloyd, E. K., Willson, R. J., Graph Theory 1736—1936, Clarendon Press, Oxford (1976).

    MATH  Google Scholar 

  3. Chauve, C., Dulucq, S. and Rechnitzer, A., Enumerating Alternating Trees, Journal of Combinatorial Theory, Series A, 94 (2001) 142–151.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  5. Harary, F. and Schwenk, A. J., The Number of Caterpillars, Discrete Mathematics, 6 (1973) 359–365.

    Article  MATH  MathSciNet  Google Scholar 

  6. Hasunuma, T. and Shibata, Y., Counting Small Cycles in Generalized de Bruijn Digraphs, Networks, 29 (1997) 39–47.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  8. Lonc, Z., Parol, K. and Wojciechowski, J. M., On the Number of Spanning Trees in Directed Circulant Graphs, Networks, 37 (2001) 129–133.

    Article  MATH  MathSciNet  Google Scholar 

  9. Nakano, S., Efficient Generation of Plane Trees, Information Processing Letters, 84 (2002) 167–172.

    Article  MATH  MathSciNet  Google Scholar 

  10. Simone, C. D., Lucertini, M., Pallottino, S. and Simeone, B., Fair Dissections of Spiders, Worms, and Caterpillars, Networks, 20 (1990) 323–344.

    Article  MATH  MathSciNet  Google Scholar 

  11. West, D. B., Introduction to Graph Theory, Second Ed., Prentice Hall, NJ (2001)

    Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Gunma University, 1-5-1 Tenjin-cho, Kiryu, Gunma, 376-8515, Japan

    Yosuke Kikuchi, Hiroyuki Tanaka, Shin-ichi Nakano & Yukio Shibata

Authors
  1. Yosuke Kikuchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroyuki Tanaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shin-ichi Nakano
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yukio Shibata
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at Austin, One University Station, C0500, Austin, TX, 78712, USA

    Tandy Warnow

  2. Department of Computer Science, Montana State University, EPS 357, Bozeman, MT, 59717, USA

    Binhai Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kikuchi, Y., Tanaka, H., Nakano, Si., Shibata, Y. (2003). How to Obtain the Complete List of Caterpillars. In: Warnow, T., Zhu, B. (eds) Computing and Combinatorics. COCOON 2003. Lecture Notes in Computer Science, vol 2697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45071-8_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-45071-8_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40534-4

  • Online ISBN: 978-3-540-45071-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation