{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:43:50Z","timestamp":1757310230294},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_10","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T10:47:32Z","timestamp":1283338052000},"page":"110-121","source":"Crossref","is-referenced-by-count":11,"title":["On the Number of Spanning Trees a Planar Graph Can Have"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Buchin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00373-007-0704-5","volume":"23","author":"O. Aichholzer","year":"2007","unstructured":"Aichholzer, O., Hackl, T., Huemer, C., Hurtado, F., Krasser, H., Vogtenhuber, B.: On the number of plane geometric graphs. Graph. Comb.\u00a023(1), 67\u201384 (2007)","journal-title":"Graph. Comb."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.24033\/bsmf.2303","volume":"125","author":"R. Bacher","year":"1997","unstructured":"Bacher, R., de la Harpe, P., Nagnibeda, T.: The lattice of integral flows and the lattice of integral cuts on a finite graph. Bull. Soc. Math. de France\u00a0125, 167\u2013198 (1997)","journal-title":"Bull. Soc. Math. de France"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1112\/S0024609397003305","volume":"29","author":"N. Biggs","year":"1997","unstructured":"Biggs, N.: Algebraic potential theory on graphs. Bull. London Math. Soc.\u00a029, 641\u2013682 (1997)","journal-title":"Bull. London Math. Soc."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1018611014097","volume":"9","author":"N. Biggs","year":"1999","unstructured":"Biggs, N.: Chip-firing and the critical group of a graph. J. Algebraic Combin.\u00a09, 25\u201346 (1999)","journal-title":"J. Algebraic Combin."},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-73545-8_12","volume-title":"Computing and Combinatorics","author":"K. Buchin","year":"2007","unstructured":"Buchin, K., Knauer, C., Kriegel, K., Schulz, A., Seidel, R.: On the number of cycles in planar graphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, pp. 97\u2013107. Springer, Heidelberg (2007)"},{"key":"10_CR6","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"10_CR7","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0012-365X(88)90182-3","volume":"69","author":"R. Grone","year":"1988","unstructured":"Grone, R., Merris, R.: A bound for the complexity of a simple graph. Discrete Mathematics\u00a069(1), 97\u201399 (1988)","journal-title":"Discrete Mathematics"},{"key":"10_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"R.A. Horn","year":"1985","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)"},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1017\/S096354830500684X","volume":"14","author":"R. Lyons","year":"2005","unstructured":"Lyons, R.: Asymptotic enumeration of spanning trees. Combinatorics, Probability & Computing\u00a014(4), 491\u2013522 (2005)","journal-title":"Combinatorics, Probability & Computing"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0195-6698(83)80045-6","volume":"4","author":"B.D. McKay","year":"1983","unstructured":"McKay, B.D.: Spanning trees in regular graphs. Euro. J. Combinatorics\u00a04, 149\u2013160 (1983)","journal-title":"Euro. J. Combinatorics"},{"key":"10_CR12","unstructured":"Rib\u00f3 Mor, A.: Realization and Counting Problems for Planar Structures: Trees and Linkages, Polytopes and Polyominoes. PhD thesis, Freie Universit\u00e4t Berlin (2006)"},{"key":"10_CR13","first-page":"112","volume-title":"Symposium on Computational Geometry","author":"A. Rib\u00f3 Mor","year":"2007","unstructured":"Rib\u00f3 Mor, A., Rote, G., Schulz, A.: Embedding 3-polytopes on a small grid. In: Erickson, J. (ed.) Symposium on Computational Geometry, pp. 112\u2013118. ACM, New York (2007)"},{"key":"10_CR14","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0093761","volume-title":"Realization Spaces of Polytopes","author":"J. Richter-Gebert","year":"1996","unstructured":"Richter-Gebert, J.: Realization Spaces of Polytopes. Lecture Notes in Mathematics, vol.\u00a01643. Springer, Heidelberg (1996)"},{"key":"10_CR15","unstructured":"Rote, G.: The number of spanning trees in a planar graph. In: Oberwolfach Reports, vol. 2, European Mathematical Society, Publishing House (2005)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Sharir, M., Sheffer, A.: Counting triangulations of planar point sets (2010) (manuscript)","DOI":"10.37236\/557"},{"key":"10_CR17","unstructured":"Steinitz, E.: Encyclop\u00e4die der mathematischen Wissenschaften. In: Polyeder und Raumteilungen, pp. 1\u2013139 (1922)"},{"issue":"2","key":"10_CR18","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/rsa.3240010210","volume":"1","author":"S. Suen","year":"1990","unstructured":"Suen, S.: A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph. Random Struct. Algorithms\u00a01(2), 231\u2013242 (1990)","journal-title":"Random Struct. Algorithms"},{"issue":"38","key":"10_CR19","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1112\/plms\/s3-10.1.304","volume":"10","author":"W.T. Tutte","year":"1960","unstructured":"Tutte, W.T.: Convex representations of graphs. Proceedings London Mathematical Society\u00a010(38), 304\u2013320 (1960)","journal-title":"Proceedings London Mathematical Society"},{"issue":"52","key":"10_CR20","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W.T. Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proceedings London Mathematical Society\u00a013(52), 743\u2013768 (1963)","journal-title":"Proceedings London Mathematical Society"},{"key":"10_CR21","first-page":"235","volume":"55","author":"H. Whitney","year":"1933","unstructured":"Whitney, H.: A set of topological invariants for graphs. Amer. J. Math.\u00a055, 235\u2013321 (1933)","journal-title":"Amer. J. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,10]],"date-time":"2020-06-10T23:46:20Z","timestamp":1591832780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}