Infinite Eulerian tessellations (Q794665)

An Eulerian graph is a graph in which there is a path which covers each edge exactly once; if the graph is directed then the path must follow the direction of each edge exactly once and cannot (for the purposes of this paper) traverse any edge once in one direction and then immediately back to the same vertex in the opposite direction. It is assumed throughout that any 1-skeleton is made into a directed graph G by directing each 1- simplex in the skeleton in both directions. In studying nonparabolic subgroups of the modular group and their connection with cubic Eulerian (directed) graphs, the authors were led to consider whether the 3 basic types of regular tesselations in the plane consisting of (1) equilateral triangles, (2) squares, and (3) regular hexagons led to Eulerian graphs. The main result is that the graph G induced by the regular plane tesselations are Eulerian. More generally, if T is a tesselation of the plane such that each face has at least p sides and each vertex has degree at least q, where \(1/p+1/q\leq 1/2,\) then, except possibly for the case \(p=3\) and \(q=6\), T is Eulerian. Let \(T^*\) be the truncation of T. If every vertex of T has degree 3 then \(T^*\) is not Eulerian. If every vertex has degree 4, or degree at least 6, then T is Eulerian.