PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

A census of edge-transitive planar tilings
Tomaž Pisanski and Karin Cvetko-Vah
In: Algebraic Graph Theory 2009, 1-7 Jun 2009, Dubrovnik, Croatia.

Abstract

Recently Graves, Pisanski andWatkins have determined the growth rates of Bilinski diagrams of one-ended, 3-connected, edge-transitive planar maps. The computation depends solely on the edge-symbol hp; q; k; li that was introduced by B. Grunbaum and G. C. Shephard in their classication of such planar tessellations. We present a census of such tessellations in which we describe some of their properties, such as whether the edge-transitive planar tessellation is vertex- or face-transitive, self-dual, bipartite or Eulerian. In particular, we order such tessellations according to the growth rate and count the number of tessellations in each subclass.

EPrint Type:Conference or Workshop Item (Talk)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:8281
Deposited By:Boris Horvat
Deposited On:21 February 2012