54 citations · 280 across the 32 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013
Orthogonality and minimality in the homology of locally finite graphs
Reinhard Diestel, Julian Pott
Given a finite set , a subset (viewed as a function $E\to \F_2$) is orthogonal to a given subspace $\FF$ of the $\F_2$-vector space of functions $E\to \F_2$ as soon as…
math.CO2013★ 6 cited
-Blocks: a connectivity invariant for graphs
Johannes Carmesin, Reinhard Diestel, Matthias Hamann +1
A -block in a graph is a maximal set of at least vertices no two of which can be separated in by fewer than other vertices. The block number of is the…