{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:35:41Z","timestamp":1725525341973},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_12","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T02:34:01Z","timestamp":1234233241000},"page":"129-140","source":"Crossref","is-referenced-by-count":0,"title":["Recursive Generation of 5-Regular Planar Graphs"],"prefix":"10.1007","author":[{"given":"Mahdieh","family":"Hasheminezhad","sequence":"first","affiliation":[]},{"given":"Brendan D.","family":"McKay","sequence":"additional","affiliation":[]},{"given":"Tristan","family":"Reeves","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Batagelj, V.: An improved inductive definition of two restricted classes of triangulations of the plane. Combinatorics and Graph Theory, Banach Center Publications, 25, PWN - Polish Scientific Publishers, Warsaw, pp. 11\u201318 (1989)","DOI":"10.4064\/-25-1-11-18"},{"key":"12_CR2","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.\u00a058, 323\u2013357 (2007), http:\/\/cs.anu.edu.au\/~bdm\/plantri","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.disc.2005.06.019","volume":"301","author":"G. Brinkmann","year":"2005","unstructured":"Brinkmann, G., McKay, B.D.: Construction of planar triangulations with minimum degree 5. Discrete Math.\u00a0301, 147\u2013163 (2005)","journal-title":"Discrete Math."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1002\/jgt.3190170508","volume":"17","author":"H.J. Broersma","year":"1993","unstructured":"Broersma, H.J., Duijvestijn, A.J.W., G\u00f6bel, F.: Generating all 3-connected 4-regular planar graphs from the octahedron graph. J.\u00a0Graph Theory\u00a017, 613\u2013620 (1993)","journal-title":"J.\u00a0Graph Theory"},{"key":"12_CR5","first-page":"686","volume":"26","author":"J.W. Butler","year":"1974","unstructured":"Butler, J.W.: A generation procedure for the simple 3-polytopes with cyclically 5-connected graphs. Can.\u00a0J.\u00a0Math.\u00a026, 686\u2013708 (1974)","journal-title":"Can.\u00a0J.\u00a0Math."},{"key":"12_CR6","unstructured":"Fontet, M.: Linear algorithms for testing isomorphism of planar graphs. In: Proceedings Third Colloquium on Automata, Languages, and Programming, pp. 411\u2013423 (1976)"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.cplett.2008.09.005","volume":"464","author":"M. Hasheminezhad","year":"2008","unstructured":"Hasheminezhad, M., Fleischner, H., McKay, B.D.: A universal set of growth operations for fullerenes. Chem. Phys. Lett.\u00a0464, 118\u2013121 (2008)","journal-title":"Chem. Phys. Lett."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Wong, J.K.: Linear time algorithm for isomorphism of planar graphs. In: 6th Annual ACM Symposium on Theory of Computing, Seattle, Washington, pp. 172\u2013184 (1974)","DOI":"10.1145\/800119.803896"},{"key":"12_CR9","first-page":"127","volume":"185","author":"J. Kanno","year":"2007","unstructured":"Kanno, J., Kriesell, M.: A generating theorem for 5-regular simple planar graphs. I. Congr. Numerantium\u00a0185, 127\u2013143 (2007)","journal-title":"Congr. Numerantium"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1002\/jgt.3190050412","volume":"5","author":"J. Lehel","year":"1981","unstructured":"Lehel, J.: Generating all 4-regular planar graphs from the graph of the octahedron. J.\u00a0Graph Theory\u00a05, 423\u2013426 (1981)","journal-title":"J.\u00a0Graph Theory"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/jagm.1997.0898","volume":"26","author":"B.D. McKay","year":"1998","unstructured":"McKay, B.D.: Isomorph-free exhaustive generation. J.\u00a0Algorithms\u00a026, 306\u2013324 (1998)","journal-title":"J.\u00a0Algorithms"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S1385-7258(61)50045-5","volume":"64","author":"W.T. Tutte","year":"1961","unstructured":"Tutte, W.T.: A theory of 3-connected graphs. Nederl. Akad. Wetensch. Proc. Ser.\u00a0A\u00a064, 441\u2013455 (1961)","journal-title":"Nederl. Akad. Wetensch. Proc. Ser.\u00a0A"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T19:07:36Z","timestamp":1558120056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}