We extend the basic theory concerning the cycle space of a finite graph to arbitrary infinite graphs, using as infinite cycles the homeomorphic images of the unit circle in the graph together with its ends. We charac-terize the spanning trees whose fundamental cycles generate the cycle space, and prove infinite analogues to the standard characterizations of finite cycle spaces in terms of edge-decomposition into single cycles and orthogonality to cuts
The cycle space of a finite graph is the subspace of the edge space generated by the edge sets of cy...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cu...
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinato...
We adapt the cycle space of a finite or locally graph to graphs with vertices of infinite degree, us...
We adapt the cycle space of a finite or locally graph to graphs with vertices of infinite degree, u...
The edge space of a finite graph G = (V, E) over a field F is simply an assignment of field element...
AbstractWe study topological versions of paths, cycles and spanning trees in infinite graphs with en...
AbstractWe generalise a fundamental graph-theoretical fact, stating that every element of the cycle ...
AbstractWe generalise a fundamental graph-theoretical fact, stating that every element of the cycle ...
We study topological versions of paths, cycles and spanning trees in in-finite graphs with ends that...
We study topological versions of paths, cycles and spanning trees in in-finite graphs with ends that...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cu...
We extend Tutte's result that in a finite 3-connected graph the cycle space is generated by th...
AbstractWe extend Tutte's result that in a finite 3-connected graph the cycle space is generated by ...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
The cycle space of a finite graph is the subspace of the edge space generated by the edge sets of cy...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cu...
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinato...
We adapt the cycle space of a finite or locally graph to graphs with vertices of infinite degree, us...
We adapt the cycle space of a finite or locally graph to graphs with vertices of infinite degree, u...
The edge space of a finite graph G = (V, E) over a field F is simply an assignment of field element...
AbstractWe study topological versions of paths, cycles and spanning trees in infinite graphs with en...
AbstractWe generalise a fundamental graph-theoretical fact, stating that every element of the cycle ...
AbstractWe generalise a fundamental graph-theoretical fact, stating that every element of the cycle ...
We study topological versions of paths, cycles and spanning trees in in-finite graphs with ends that...
We study topological versions of paths, cycles and spanning trees in in-finite graphs with ends that...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cu...
We extend Tutte's result that in a finite 3-connected graph the cycle space is generated by th...
AbstractWe extend Tutte's result that in a finite 3-connected graph the cycle space is generated by ...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
The cycle space of a finite graph is the subspace of the edge space generated by the edge sets of cy...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cu...
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinato...