{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T12:42:23Z","timestamp":1776688943321,"version":"3.51.2"},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0095-8956(02)00040-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T17:16:12Z","timestamp":1051118172000},"page":"119-134","source":"Crossref","is-referenced-by-count":28,"title":["On random planar graphs, the number of planar graphs and their triangulations"],"prefix":"10.1016","volume":"88","author":[{"given":"Deryk","family":"Osthus","sequence":"first","affiliation":[]},{"given":"Hans J\u00fcrgen","family":"Pr\u00f6mel","sequence":"additional","affiliation":[]},{"given":"Anusch","family":"Taraz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0095-8956(02)00040-0_BIB1","unstructured":"A. Bender, Z. Gao, N.C. Wormald, The number of labeled 2-connected planar graphs, preprint, 2000."},{"key":"10.1016\/S0095-8956(02)00040-0_BIB2","first-page":"61","article-title":"The random planar graph","volume":"113","author":"Denise","year":"1996","journal-title":"Congr. Numer."},{"key":"10.1016\/S0095-8956(02)00040-0_BIB3","series-title":"Graph Theory","author":"Diestel","year":"1997"},{"key":"10.1016\/S0095-8956(02)00040-0_BIB4","unstructured":"S. Gerke, C. McDiarmid, On the number of edges in random planar graphs, to appear in Combinatorics, Probability and Computing."},{"key":"10.1016\/S0095-8956(02)00040-0_BIB5","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1993"},{"key":"10.1016\/S0095-8956(02)00040-0_BIB6","unstructured":"C. McDiarmid, A. Steger, D. Welsh, Random planar graphs, preprint, 2001."},{"key":"10.1016\/S0095-8956(02)00040-0_BIB7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0021-9800(68)80007-9","article-title":"The enumeration of c-nets via quadrangulations","volume":"4","author":"Mullin","year":"1968","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0095-8956(02)00040-0_BIB8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.4153\/CJM-1962-002-9","article-title":"A census of planar triangulations","volume":"14","author":"Tutte","year":"1962","journal-title":"Canad. J. Math."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895602000400?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895602000400?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T10:23:01Z","timestamp":1553941381000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895602000400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0095895602000400"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(02)00040-0","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}