3 citations · 3 across the 1 of their papers we have counts for
1 paper · 1 filter
Reinhard Diestel, Philipp Sprüssel
We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding…