{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T02:44:13Z","timestamp":1748573053028},"reference-count":11,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":4721,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1993,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We prove that all 3\u2010connected 4\u2010regular planar graphs can be generated from the Octahedron Graph, using three operations. We generated these graphs up to 15 vertices inclusive. Moreover, by including a fourth operation we obtain an alternative to a procedure by Lehel to generate all connected 4\u2010regular planar graphs from the Octahedron Graph. \u00a9 1993 John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/jgt.3190170508","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T13:25:04Z","timestamp":1180185904000},"page":"613-620","source":"Crossref","is-referenced-by-count":19,"title":["Generating all 3\u2010connected 4\u2010regular planar graphs from the octahedron graph"],"prefix":"10.1002","volume":"17","author":[{"given":"H. J.","family":"Broersma","sequence":"first","affiliation":[]},{"given":"A. J. W.","family":"Duijvestijn","sequence":"additional","affiliation":[]},{"given":"F.","family":"G\u00f6bel","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"e_1_2_1_3_2","unstructured":"A. J. W.Duijvestijn Electronic computation of squared rectangles. Thesis Technische Hogeschool Eindhoven The Netherlands (1962);"},{"key":"e_1_2_1_3_3","doi-asserted-by":"crossref","unstructured":"also in Philips Res. Rep.17(1962)523\u2013612.","DOI":"10.1038\/hdy.1962.53"},{"key":"e_1_2_1_4_2","volume-title":"Algorithmic calculation of the order of the automorphism group of a graph","author":"Duijvestijn A. J. W.","year":"1978"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.2307\/2007444"},{"key":"e_1_2_1_6_2","unstructured":"R. B.King personal communication."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1021\/ja00756a019"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190050412"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190030406"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(68)80007-9"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1963-029-x"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190170508","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190170508","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T07:58:48Z","timestamp":1698307128000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190170508"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["10.1002\/jgt.3190170508"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190170508","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}