{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:22:16Z","timestamp":1725790936861},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_34","type":"book-chapter","created":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T03:02:27Z","timestamp":1395716547000},"page":"391-398","source":"Crossref","is-referenced-by-count":1,"title":["Relatively Bridge-Addable Classes of Graphs"],"prefix":"10.1007","author":[{"given":"Colin","family":"McDiarmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kerstin","family":"Weller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1017\/S0963548312000272","volume":"21","author":"L. Addario-Berry","year":"2012","unstructured":"Addario-Berry, L., McDiarmid, C., Reed, B.: Connectivity for Bridge-Addable Monotone Graph Classes. Combinatorics, Probability and Computing\u00a021, 803\u2013815 (2012)","journal-title":"Combinatorics, Probability and Computing"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. John Wiley & Sons Inc. (2008)","DOI":"10.1002\/9780470277331"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/j.jctb.2007.09.003","volume":"98","author":"P. Balister","year":"2008","unstructured":"Balister, P., Bollob\u00e1s, B., Gerke, S.: Connectivity of addable graph classes. Journal of Combinatorial Theory, Series B\u00a098, 577\u2013584 (2008)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511814068"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.jctb.2012.12.001","volume":"103","author":"M. Kang","year":"2013","unstructured":"Kang, M., Panagiotou, K.: On the connectivity of random graphs from addable classes. Journal of Combinatorial Theory, Series B\u00a0103, 306\u2013312 (2013)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"34_CR6","first-page":"20","volume":"53","author":"C. McDiarmid","year":"2012","unstructured":"McDiarmid, C.: Connectivity for random graphs from a weighted bridge-addable class. Electronic Journal of Combinatorics 19, Paper 53, 20 (2012)","journal-title":"Electronic Journal of Combinatorics 19, Paper"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1017\/S0963548309009717","volume":"18","author":"C. McDiarmid","year":"2009","unstructured":"McDiarmid, C.: Random graphs from a minor-closed class. Combinatorics, Probability and Computing\u00a018, 583\u2013599 (2009)","journal-title":"Combinatorics, Probability and Computing"},{"key":"34_CR8","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-33700-8_15","volume-title":"Topics in Discrete Mathematics","author":"C. McDiarmid","year":"2006","unstructured":"McDiarmid, C., Steger, A., Welsh, D.J.A.: Random Graphs from Planar and Other Addable Classes. In: Topics in Discrete Mathematics. Algorithms and Combinatorics, vol.\u00a026, pp. 231\u2013246. Springer, Heidelberg (2006)"},{"key":"34_CR9","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. Journal of Combinatorial Theory, Series B\u00a093, 187\u2013205 (2005)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"34_CR10","unstructured":"McDiarmid, C., Weller, K.: Connectivity for relatively bridge-addable classes of graphs (in preparation)"},{"key":"34_CR11","unstructured":"Moon, J.W.: Counting Labelled Trees, Canadian Mathematical Congress, Montreal, Quebec (1970)"},{"key":"34_CR12","first-page":"73","volume":"4","author":"A. R\u00e9nyi","year":"1959","unstructured":"R\u00e9nyi, A.: Some remarks on the theory of trees. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl\u00a04, 73\u201385 (1959)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Scoins, H.I.: The number of trees with nodes of alternate parity. In: Proc. Cambridge Philos. Soc., vol.\u00a058, pp. 12\u201316 (1962)","DOI":"10.1017\/S0305004100036173"}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T12:49:31Z","timestamp":1558874971000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}