Über ebene Vierecksgraphen. (On plane quadrangular graphs) (Q1083456)

In the paper under review all graphs are finite, simple, and connected. A plane graph G is said to be quadrangular if all its faces are quadrangles. The author discusses a special class of quadrangular graphs with the following property: If one adds the two diagonals in each face of G then the resulting graph has no multiple edges. Among other things it is shown that there are exactly 11 graphs in this class with 14 vertices each.