{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:28Z","timestamp":1725493648013},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_34","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"329-338","source":"Crossref","is-referenced-by-count":1,"title":["How to Obtain the Complete List of Caterpillars"],"prefix":"10.1007","author":[{"given":"Yosuke","family":"Kikuchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"Tanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-ichi","family":"Nakano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yukio","family":"Shibata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1137\/0209055","volume":"9","author":"T. Beyer","year":"1980","unstructured":"Beyer, T. and Hedetiniemi, S. M., Constant Time Generation of Rooted Trees, SIAM J. Comput., 9 (1980) 706\u2013712.","journal-title":"SIAM J. Comput."},{"key":"34_CR2","volume-title":"Graph Theory 1736\u20141936","author":"N. L. Biggs","year":"1976","unstructured":"Biggs, N. L., Lloyd, E. K., Willson, R. J., Graph Theory 1736\u20141936, Clarendon Press, Oxford (1976)."},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/jcta.2000.3121","volume":"94","author":"C. Chauve","year":"2001","unstructured":"Chauve, C., Dulucq, S. and Rechnitzer, A., Enumerating Alternating Trees, Journal of Combinatorial Theory, Series A, 94 (2001) 142\u2013151.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0020-0190(00)00135-6","volume":"76","author":"K.-L. Chung","year":"2000","unstructured":"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\u2013119.","journal-title":"Information Processing Letters"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0012-365X(73)90067-8","volume":"6","author":"F. Harary","year":"1973","unstructured":"Harary, F. and Schwenk, A. J., The Number of Caterpillars, Discrete Mathematics, 6 (1973) 359\u2013365.","journal-title":"Discrete Mathematics"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/(SICI)1097-0037(199701)29:1<39::AID-NET4>3.0.CO;2-D","volume":"29","author":"T. Hasunuma","year":"1997","unstructured":"Hasunuma, T. and Shibata, Y., Counting Small Cycles in Generalized de Bruijn Digraphs, Networks, 29 (1997) 39\u201347.","journal-title":"Networks"},{"key":"34_CR7","series-title":"Lect Notes Comput Sci","first-page":"433","volume-title":"Proc. of ICALP 2001","author":"Z. Li","year":"2001","unstructured":"Li, Z. and Nakano, S., Efficient Generation of Plane Triangulations without Repetitions, Proc. of ICALP 2001, Lecture Notes in Comp. Sci., 2079, (2001) 433\u2013443."},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/net.2","volume":"37","author":"Z. Lonc","year":"2001","unstructured":"Lonc, Z., Parol, K. and Wojciechowski, J. M., On the Number of Spanning Trees in Directed Circulant Graphs, Networks, 37 (2001) 129\u2013133.","journal-title":"Networks"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0020-0190(02)00240-5","volume":"84","author":"S. Nakano","year":"2002","unstructured":"Nakano, S., Efficient Generation of Plane Trees, Information Processing Letters, 84 (2002) 167\u2013172.","journal-title":"Information Processing Letters"},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/net.3230200305","volume":"20","author":"C. D. Simone","year":"1990","unstructured":"Simone, C. D., Lucertini, M., Pallottino, S. and Simeone, B., Fair Dissections of Spiders, Worms, and Caterpillars, Networks, 20 (1990) 323\u2013344.","journal-title":"Networks"},{"key":"34_CR11","volume-title":"Introduction to Graph Theory","author":"D. B. West","year":"2001","unstructured":"West, D. B., Introduction to Graph Theory, Second Ed., Prentice Hall, NJ (2001)","edition":"Second Ed."},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/0215039","volume":"15","author":"R. A. Wright","year":"1986","unstructured":"Wright, R. A., Richmond, B., Odlyzko, A. and Mckay, B. D., Constant Time Generation of Free Tree, SIAM J. Comput., 15 (1986) 540\u2013548.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T15:52:11Z","timestamp":1551023531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}