{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T18:22:32Z","timestamp":1784571752567,"version":"3.55.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319200859","type":"print"},{"value":"9783319200866","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20086-6_18","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:27:10Z","timestamp":1434702430000},"page":"235-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Generation of Stable Planar Cages for Chemistry"],"prefix":"10.1007","author":[{"given":"Dominique","family":"Barth","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Olivier","family":"David","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Franck","family":"Quessette","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vincent","family":"Reinhard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yann","family":"Strozecki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sandrine","family":"Vial","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1038\/nchem.873","volume":"2","author":"J Holst","year":"2010","unstructured":"Holst, J., Trewin, A., Cooper, A.: Porous organic molecules. Nature Chem. 2, 915\u2013920 (2010)","journal-title":"Nature Chem."},{"key":"18_CR2","unstructured":"Strozecki, Y.: Enumeration complexity and matroid decomposition. Ph.D thesis, Universit\u00e9 Paris Diderot - Paris 7 (2010)"},{"key":"18_CR3","unstructured":"Li, G., Ruskey, F.: The advantages of forward thinking in generating rooted and free trees. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 939\u2013940 (1999)"},{"key":"18_CR4","first-page":"304","volume":"4","author":"V Liskovets","year":"1985","unstructured":"Liskovets, V.: Enumeration of nonisomorphic planar maps. Selecta Math. Soviet. 4, 304\u2013323 (1985)","journal-title":"Selecta Math. Soviet."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.4153\/CJM-1981-078-2","volume":"33","author":"R Cori","year":"1981","unstructured":"Cori, R., Vauquelin, B.: Planar maps are labelled trees. Canadian Journal Math. 33, 1023\u20131042 (1981)","journal-title":"Canadian Journal Math."},{"key":"18_CR6","first-page":"323","volume":"58","author":"G Brinkmann","year":"2007","unstructured":"Brinkmann, G., McKay, B.D.: Fast generation of planar graphs. MATCH Commun. Math. Comput. Chem 58, 323\u2013357 (2007)","journal-title":"MATCH Commun. Math. Comput. Chem"},{"key":"18_CR7","first-page":"533","volume":"63","author":"G Brinkmann","year":"2010","unstructured":"Brinkmann, G., Friedrichs, O.D., Lisken, S., Peeters, A., Van Cleemput, N.: Cage\u2013a virtual environment for studying some special classes of plane graphs\u2013an update. MATCH Commun. Math. Comput. Chem 63, 533\u2013552 (2010)","journal-title":"MATCH Commun. Math. Comput. Chem"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Barth, D., Boudaoud, B., Couty, F., David, O., Quessette, F., Vial, S.: Map generation for CO$$_2$$ cages. In: Computer and Information Sciences III, pp. 503\u2013510. Springer (2013)","DOI":"10.1007\/978-1-4471-4594-3_52"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0095-8956(88)90075-5","volume":"45","author":"DA Holton","year":"1988","unstructured":"Holton, D.A., McKay, B.D.: The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices. Journal of Combinatorial Theory, Series B 45, 305\u2013319 (1988)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Barth, D., David, O., Quessette, F., Reinhard, V., Strozecki, Y., Vial, S.: Efficient generation of stable planar cages for chemistry (2015). arXiv:1503.06610","DOI":"10.1007\/978-3-319-20086-6_18"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s003730050046","volume":"15","author":"RE Aldred","year":"1999","unstructured":"Aldred, R.E., Bau, S., Holton, D.A., McKay, B.D.: Cycles through 23 vertices in 3-connected cubic planar graphs. Graphs and Combinatorics 15, 373\u2013376 (1999)","journal-title":"Graphs and Combinatorics"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Wong, J.K.: Linear time algorithm for isomorphism of planar graphs (preliminary report). In: ACM Symposium on Theory of Computing, pp. 172\u2013184 (1974)","DOI":"10.1145\/800119.803896"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"313","DOI":"10.7155\/jgaa.00094","volume":"8","author":"JP Kukluk","year":"2004","unstructured":"Kukluk, J.P., Holder, L.B., Cook, D.J.: Algorithm and experiments in testing planar graphs for isomorphism. Journal of Graphs Algorithms and Applications 8, 313\u2013356 (2004)","journal-title":"Journal of Graphs Algorithms and Applications"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1109\/TCT.1966.1082573","volume":"13","author":"L Weinberg","year":"1966","unstructured":"Weinberg, L.: A simple and efficient algorithm for determining isomorphism of planar triply connected graphs. Circuit Theory 13, 142\u2013148 (1966)","journal-title":"Circuit Theory"},{"key":"18_CR15","volume-title":"Computers and intractability: a guide to NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and intractability: a guide to NP-completeness. WH Freeman and Company, San Francisco (1979)"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Park, J.K., Phillips, C.A.: Finding minimum-quotient cuts in planar graphs. In: ACM Symposium on Theory of Computing, pp. 766\u2013775 (1993)","DOI":"10.1145\/167088.167284"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph theory. 2005. Grad. Texts in Math (2005)","DOI":"10.1007\/978-3-642-14279-6_7"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20086-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:38:35Z","timestamp":1676943515000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20086-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200859","9783319200866"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20086-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}