{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T21:40:14Z","timestamp":1771623614560,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540735441","type":"print"},{"value":"9783540735458","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73545-8_12","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T09:44:11Z","timestamp":1187343851000},"page":"97-107","source":"Crossref","is-referenced-by-count":20,"title":["On the Number of Cycles in Planar Graphs"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Buchin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Knauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Kriegel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raimund","family":"Seidel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"12_CR1","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1017\/S0963548399003995","volume":"8","author":"H. Alt","year":"1999","unstructured":"Alt, H., Fuchs, U., Kriegel, K.: On the number of simple cycles in planar graphs. Combinatorics, Probability & Computing\u00a08(5), 397\u2013405 (1999)","journal-title":"Combinatorics, Probability & Computing"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1145\/1109557.1109652","volume-title":"Proc. 17th ACM-SIAM Sympos. Discrete Algorithms","author":"M. Sharir","year":"2006","unstructured":"Sharir, M., Welzl, E.: On the number of crossing-free matchings (cycles, and partitions). In: Proc. 17th ACM-SIAM Sympos. Discrete Algorithms, pp. 860\u2013869. ACM Press, New York (2006)"},{"key":"12_CR3","first-page":"273","volume-title":"22nd Annu. ACM Sympos. Comput. Geom.","author":"M. Sharir","year":"2006","unstructured":"Sharir, M., Welzl, E.: Random triangulations of planar point sets. In: 22nd Annu. ACM Sympos. Comput. Geom., pp. 273\u2013281. ACM Press, New York (2006)"},{"key":"12_CR4","unstructured":"Barequet, G., Moffie, M.: The complexity of Jensen\u2019s algorithm for counting polyominoes. In: Proc. 1st Workshop on Analytic Algorithmics and Combinatorics, pp. 161\u2013169 (2004)"},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1088\/0305-4470\/28\/4\/015","volume":"28","author":"A. Conway","year":"1995","unstructured":"Conway, A., Guttmann, A.: On two-dimensional percolation. J. Phys. A: Math. Gen.\u00a028(4), 891\u2013904 (1995)","journal-title":"J. Phys. A: Math. Gen."},{"issue":"3\u20134","key":"12_CR6","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1023\/A:1004855020556","volume":"102","author":"I. Jensen","year":"2001","unstructured":"Jensen, I.: Enumerations of lattice animals and trees. J. Stat. Phys.\u00a0102(3\u20134), 865\u2013881 (2001)","journal-title":"J. Stat. Phys."},{"key":"12_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511609589","volume-title":"Enumerative combinatorics","author":"R.P. Stanley","year":"1999","unstructured":"Stanley, R.P.: Enumerative combinatorics, vol.\u00a02. Cambridge University Press, Cambridge (1999)"},{"key":"12_CR8","volume-title":"Nonnegative Matrices and Applicable Topics in Linear Algebra","author":"A. Graham","year":"1987","unstructured":"Graham, A.: Nonnegative Matrices and Applicable Topics in Linear Algebra. John Wiley & Sons, New York (1987)"},{"key":"12_CR9","unstructured":"Stoffel, A.: Software for Counting Cycles on the Twisted Cylinder, \n                  \n                    http:\/\/page.mi.fu-berlin.de\/~schulza\/cyclecount\/"},{"key":"12_CR10","volume-title":"Matching theory","author":"L. Lovasz","year":"1986","unstructured":"Lovasz, L., Plummer, M.: Matching theory. Elsevier, Amsterdam (1986)"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1145\/1109557.1109613","volume-title":"Proc. 17th ACM-SIAM Sympos. Discrete Algorithms","author":"O. Aichholzer","year":"2006","unstructured":"Aichholzer, O., Hackl, T., Vogtenhuber, B., Huemer, C., Hurtado, F., Krasser, H.: On the number of plane graphs. In: Proc. 17th ACM-SIAM Sympos. Discrete Algorithms, pp. 504\u2013513. ACM Press, New York (2006)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:17:44Z","timestamp":1619504264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735441","9783540735458"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}