{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:30:51Z","timestamp":1725517851162},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540853626"},{"type":"electronic","value":"9783540853633"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85363-3_25","type":"book-chapter","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T19:29:28Z","timestamp":1219865368000},"page":"303-316","source":"Crossref","is-referenced-by-count":9,"title":["On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs"],"prefix":"10.1007","author":[{"given":"Nicla","family":"Bernasconi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Panagiotou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelika","family":"Steger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Cambridge Studies in Advanced Mathematics","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random graphs","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random graphs, 2nd edn. Cambridge Studies in Advanced Mathematics, vol.\u00a073. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"25_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. John Wiley & Sons, Chichester (2000)"},{"key":"25_CR3","first-page":"61","volume":"113","author":"A. Denise","year":"1996","unstructured":"Denise, A., Vasconcellos, M., Welsh, D.J.A.: The random planar graph. Congr. Numer.\u00a0113, 61\u201379 (1996)","journal-title":"Congr. Numer."},{"issue":"2","key":"25_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.jctb.2004.09.007","volume":"93","author":"C. McDiarmid","year":"2005","unstructured":"McDiarmid, C., Steger, A., Welsh, D.J.A.: Random planar graphs. J. Combin. Theory Ser. B\u00a093(2), 187\u2013205 (2005)","journal-title":"J. Combin. Theory Ser. B"},{"key":"25_CR5","first-page":"999","volume-title":"Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"S. Gerke","year":"2005","unstructured":"Gerke, S., McDiarmid, C., Steger, A., Wei\u00dfl, A.: Random planar graphs with n nodes and a fixed number of edges. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 999\u20131007. ACM, New York (2005) (electronic)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Gim\u00e9nez, O., Noy, M.: The number of planar graphs and properties of random planar graphs. In: 2005 Int. Conf. on An. of Alg. Discrete Math. Theor. Comput. Sci. Proc., AD. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, pp. 147\u2013156 (2005) (electronic)","DOI":"10.46298\/dmtcs.3354"},{"key":"25_CR7","unstructured":"Flajolet, P., Sedgewick, R.: Analytic combinatorics (Book in preparation, October 2005)"},{"key":"25_CR8","unstructured":"Bernasconi, N., Panagiotou, K., Steger, A.: On properties of random dissections and triangulations. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 132\u2013141 (2008), www.as.inf.ethz.ch\/research\/publications\/2008\/index\/"},{"issue":"4-5","key":"25_CR9","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1017\/S0963548304006315","volume":"13","author":"P. Duchon","year":"2004","unstructured":"Duchon, P., Flajolet, P., Louchard, G., Schaeffer, G.: Boltzmann samplers for the random generation of combinatorial structures. Combin. Probab. Comput.\u00a013(4-5), 577\u2013625 (2004)","journal-title":"Combin. Probab. Comput."},{"key":"25_CR10","unstructured":"Drmota, M., Gim\u00e9nez, O., Noy, M.: Vertices of given degree in series-parallel graphs (preprint)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Fusy, \u00c9.: Quadratic exact size and linear approximate size random generation of planar graphs. In: Mart\u00ednez, C. (ed.) 2005 In. Conf. on An. of Al. DMTCS Proceedings. Discrete Mathematics and Theoretical Computer Science, vol.\u00a0AD, pp. 125\u2013138 (2005)","DOI":"10.46298\/dmtcs.3362"},{"key":"25_CR12","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Combinatorial species and tree-like structures","author":"F. Bergeron","year":"1998","unstructured":"Bergeron, F., Labelle, G., Leroux, P.: Combinatorial species and tree-like structures. Encyclopedia of Mathematics and its Applications, vol.\u00a067. Cambridge University Press, Cambridge (1998)"},{"key":"25_CR13","series-title":"Cambridge Studies in Advanced Mathematics","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511805967","volume-title":"Enumerative combinatorics. Vol. 1.","author":"R.P. Stanley","year":"1997","unstructured":"Stanley, R.P.: Enumerative combinatorics. Vol. 1. Cambridge Studies in Advanced Mathematics, vol.\u00a049. Cambridge University Press, Cambridge (1997); With a foreword by Gian-Carlo Rota, Corrected reprint of the 1986 original"},{"issue":"1-2","key":"25_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(94)90226-7","volume":"132","author":"P. Flajolet","year":"1994","unstructured":"Flajolet, P., Zimmerman, P., Van Cutsem, B.: A calculus for the random generation of labelled combinatorial structures. Theoret. Comput. Sci.\u00a0132(1-2), 1\u201335 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR15","unstructured":"Bernasconi, N., Panagiotou, K., Steger, A.: On the degree sequences of random outerplanar and series-parallel graphs, www.as.inf.ethz.ch\/research\/publications\/2008\/index\/"},{"key":"25_CR16","volume-title":"Graphical Enumeration","author":"F. Harary","year":"1973","unstructured":"Harary, F., Palmer, E.: Graphical Enumeration. Academic Press, New York (1973)"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Bodirsky, M., Gim\u00e9nez, O., Kang, M., Noy, M.: On the number of series parallel and outerplanar graphs. In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2005). DMTCS Proceedings., Discrete Mathematics and Theoretical Computer Science, vol.\u00a0AE, pp. 383\u2013388 (2005)","DOI":"10.46298\/dmtcs.3451"},{"issue":"1","key":"25_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(82)90072-7","volume":"32","author":"T.R.S. Walsh","year":"1982","unstructured":"Walsh, T.R.S.: Counting labelled three-connected and homeomorphically irreducible two-connected graphs. J. Combin. Theory Ser. B\u00a032(1), 1\u201311 (1982)","journal-title":"J. Combin. Theory Ser. B"},{"key":"#cr-split#-25_CR19.1","doi-asserted-by":"crossref","unstructured":"Bender, E.A., Gao, Z., Wormald, N.C.: The number of labeled 2-connected planar graphs. Electron. J. Combin.??9(1) (2002);","DOI":"10.37236\/1659"},{"key":"#cr-split#-25_CR19.2","unstructured":"Research Paper 43, 13 pp. (electronic)"},{"key":"25_CR20","unstructured":"Fusy, E., Kang, M., Shoilekova, B.: A complete grammar for decomposing a family of graphs into 3-connected components. (submitted for publication) (2008)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85363-3_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,15]],"date-time":"2021-09-15T16:02:04Z","timestamp":1631721724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85363-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540853626","9783540853633"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85363-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}