{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T02:12:10Z","timestamp":1648951930252},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T00:00:00Z","timestamp":1281398400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s00453-010-9435-8","type":"journal-article","created":{"date-parts":[[2010,8,9]],"date-time":"2010-08-09T10:22:52Z","timestamp":1281349372000},"page":"758-776","source":"Crossref","is-referenced-by-count":0,"title":["Subgraphs of 4-Regular Planar Graphs"],"prefix":"10.1007","volume":"61","author":[{"given":"Chris","family":"Dowden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louigi","family":"Addario-Berry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,10]]},"reference":[{"key":"9435_CR1","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.tcs.2007.02.045","volume":"379","author":"M. Bodirsky","year":"2007","unstructured":"Bodirsky, M., Gr\u00f6pl, C.: Generating labelled planar graphs uniformly at random. Theor. Comput. Sci. 379, 377\u2013386 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"9435_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(02)00413-4","volume":"131","author":"H.L. Bodlaender","year":"2007","unstructured":"Bodlaender, H.L., Tan, R.B., van Leeuwen, J.: Finding a \u0394-regular supergraph of minimum order. Discrete Appl. Math. 131, 3\u20139 (2007)","journal-title":"Discrete Appl. Math."},{"key":"9435_CR3","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"9435_CR4","unstructured":"Dowden, C.: Uniform random planar graphs with degree constraints. PhD thesis (2008). Available at http:\/\/ora.ouls.ox.ac.uk"},{"key":"9435_CR5","doi-asserted-by":"crossref","unstructured":"Even, S., Kariv, O.: An O(n 2.5) algorithm for maximum matching in graphs. In: Proceedings of the 16th Annual IEEE Symposium on Foundations of Computer Science, pp. 100\u2013112 (1975)","DOI":"10.1109\/SFCS.1975.5"},{"key":"9435_CR6","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 ACM-SIAM Symposium on Discrete Algorithms, pp. 999\u20131007 (2005)"},{"key":"9435_CR7","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1090\/S0894-0347-08-00624-3","volume":"22","author":"O. Gim\u00e9nez","year":"2009","unstructured":"Gim\u00e9nez, O., Noy, M.: Asymptotic enumeration and limit laws of planar graphs. J. Am. Math. Soc. 22, 309\u2013329 (2009)","journal-title":"J. Am. Math. Soc."},{"key":"9435_CR8","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2, 135\u2013158 (1973)","journal-title":"SIAM J. Comput."},{"key":"9435_CR9","doi-asserted-by":"crossref","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.: Random planar graphs. J. Comb. Theory Ser. B 93, 187\u2013205 (2005)","journal-title":"J. Comb. Theory Ser. B"},{"key":"9435_CR10","doi-asserted-by":"crossref","first-page":"245","DOI":"10.2307\/2371127","volume":"55","author":"H. Whitney","year":"1933","unstructured":"Whitney, H.: 2-isomorphic graphs. Am. J. Math. 55, 245\u2013254 (1933)","journal-title":"Am. J. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9435-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9435-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9435-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T09:14:25Z","timestamp":1559380465000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9435-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,10]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9435"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9435-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,10]]}}}