Year: 2023
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Hammack, Richard H., Kainen, Paul C.
Institutions: Virginia Commonwealth University, Georgetown University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4390528643