{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T19:22:09Z","timestamp":1708975329930},"reference-count":6,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T00:00:00Z","timestamp":1159920000000},"content-version":"vor","delay-in-days":7065,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1987,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Graphs which are more or less \u201csymmetric\u201d in one sense or another have been the subject of many investigations. In particular, finite graphs in which all edges are equivalent under isomorphisms of the graph have attracted some attention (see, for example, Fleischner and Imrich [2], Gr\u00fcnbaum and Shephard [5]). Here we extend this investigation to infinite planar graphs which are \u201creasonable\u201d in the sense that they have locally\u2010finite plane embeddings. The purpose of this paper is to give a complete enumeration of such graphs, both finite and infinite.<\/jats:p><jats:p>We remark that the seemingly similar problem of determining all planar graphs in which the vertices are equivalent under isomorphisms of the graph appears to be much harder, and at present we are very far from a solution.<\/jats:p>","DOI":"10.1002\/jgt.3190110204","type":"journal-article","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T05:27:41Z","timestamp":1181366861000},"page":"141-155","source":"Crossref","is-referenced-by-count":14,"title":["Edge\u2010transitive planar graphs"],"prefix":"10.1002","volume":"11","author":[{"given":"Branko","family":"Gr\u00fcnbaum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. C.","family":"Shephard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,4]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Regul\u00e4re Figuren","author":"Fejes T\u00f3th L.","year":"1965"},{"key":"e_1_2_1_3_2","first-page":"97","article-title":"Transitive planar graphs","volume":"29","author":"Fleischner H.","year":"1979","journal-title":"Math. Slovaca"},{"key":"e_1_2_1_4_2","volume-title":"Euclidean and Non\u2010Euclidean Geometries","author":"Greenberg M. J.","year":"1980"},{"key":"e_1_2_1_5_2","first-page":"124","volume-title":"Combinatorics, Proceedings of the Eighth British Combinatorial Conference, Swansea, 1981","author":"Gr\u00fcnbaum B.","year":"1981"},{"key":"e_1_2_1_6_2","first-page":"65","volume-title":"The Geometric Vein. The Coxeter Festschrift","author":"Gr\u00fcnbaum B.","year":"1982"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190110204","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190110204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T18:56:01Z","timestamp":1698000961000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190110204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["10.1002\/jgt.3190110204"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190110204","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}