Premium
Edge‐transitive planar graphs
Author(s) -
Grünbaum Branko,
Shephard G. C.
Publication year - 1987
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190110204
Subject(s) - mathematics , combinatorics , 1 planar graph , planar graph , transitive relation , pathwidth , discrete mathematics , book embedding , indifference graph , enumeration , graph , chordal graph , line graph
Abstract Graphs which are more or less “symmetric” 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ünbaum and Shephard [5]). Here we extend this investigation to infinite planar graphs which are “reasonable” in the sense that they have locally‐finite plane embeddings. The purpose of this paper is to give a complete enumeration of such graphs, both finite and infinite. 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.