Eulerian edge sets in locally finite graphs

Eli Berger, Henning Bruhn

Research output: Contribution to journalArticlepeer-review


In a finite graph, an edge set Z is an element of the cycle space if and only if every vertex has even degree in Z. We extend this basic result to the topological cycle space, which allows infinite circuits, of locally finite graphs. In order to do so, it becomes necessary to attribute a parity to the ends of the graph.

Original languageEnglish
Pages (from-to)21-38
Number of pages18
Issue number1
StatePublished - Jan 2011

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics


Dive into the research topics of 'Eulerian edge sets in locally finite graphs'. Together they form a unique fingerprint.

Cite this