AbstractWe generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and replace the cycle space of a graph by a new homology group for continua which is a quotient of the first singular homology group H1. This homology seems to be particularly apt for studying spaces with infinitely generated H1, e.g. infinite graphs or fractals
This paper continues the investigation of the configuration space of two distinct points on a graph....
AbstractIt is known that the cycle space of a planar graph G is generated by boundaries of faces of ...
AbstractWe investigate some properties of graohs whose cycle space has a basis constituted of triang...
AbstractWe generalise a fundamental graph-theoretical fact, stating that every element of the cycle ...
We extend the basic theory concerning the cycle space of a finite graph to arbitrary infinite graphs...
We adapt the cycle space of a finite or locally graph to graphs with vertices of infinite degree, u...
We adapt the cycle space of a finite or locally graph to graphs with vertices of infinite degree, us...
Unless the opposite is stated all spaces in this note are continua, that is: compact connected and m...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cu...
AbstractThis paper is the last part of a comprehensive survey of a newly emerging field: a topologic...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cu...
For a finite graph G and a natural number n we study the homology of the configuration space Conf_n(...
AbstractThomassen and Vella (Graph-like continua, augmenting arcs, and Menger’s Theorem, Combinatori...
The deck of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}] \colon x \in X\...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
This paper continues the investigation of the configuration space of two distinct points on a graph....
AbstractIt is known that the cycle space of a planar graph G is generated by boundaries of faces of ...
AbstractWe investigate some properties of graohs whose cycle space has a basis constituted of triang...
AbstractWe generalise a fundamental graph-theoretical fact, stating that every element of the cycle ...
We extend the basic theory concerning the cycle space of a finite graph to arbitrary infinite graphs...
We adapt the cycle space of a finite or locally graph to graphs with vertices of infinite degree, u...
We adapt the cycle space of a finite or locally graph to graphs with vertices of infinite degree, us...
Unless the opposite is stated all spaces in this note are continua, that is: compact connected and m...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cu...
AbstractThis paper is the last part of a comprehensive survey of a newly emerging field: a topologic...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cu...
For a finite graph G and a natural number n we study the homology of the configuration space Conf_n(...
AbstractThomassen and Vella (Graph-like continua, augmenting arcs, and Menger’s Theorem, Combinatori...
The deck of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}] \colon x \in X\...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
This paper continues the investigation of the configuration space of two distinct points on a graph....
AbstractIt is known that the cycle space of a planar graph G is generated by boundaries of faces of ...
AbstractWe investigate some properties of graohs whose cycle space has a basis constituted of triang...