Eulerian 2-Complexes
Richard H. Hammack, Paul C. Kainen
TL;DR
The paper generalizes Euler's equivalence from graphs to strongly connected 2-complexes by introducing circlets as minimal even 2-complexes and Euler covers as maps from a connected surface that cover each 2-cell exactly once. It proves the equivalence: a 2-complex $K$ is even iff it is a face-disjoint union of circlets iff $K$ has an Euler cover, with explicit constructions showing each circlet admits an Euler cover. A key contribution is the decomposition of any even 2-complex into circlets and the constructive splicing of individual Euler covers into a global cover. The results yield concrete decompositions for familiar 2-skeletons (e.g., of simplices and Platonic solids) and lay groundwork for higher-dimensional generalizations, while noting caveats related to manifold structure in dimensions $>2$.
Abstract
It is shown that Euler's theorem for graphs can be generalized for 2-complexes. Two notions that generalize cycle and Eulerian tour are introduced (``circlet'' and ``Eulerian cover''), and we show that for a strongly-connected, pure 2-complex, the following are equivalent: (i) each edge meets a positive even number of 2-cells (faces), (ii) the complex can be decomposed as the face-disjoint union of circlets, and (iii) the complex has an Eulerian cover. A number of examples are provided.
