Cycle decompositions: from graphs to continua
From MaRDI portal
(Redirected from Publication:655366)
Abstract: We 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 . This homology seems to be particularly apt for studying spaces with infinitely generated , e.g. infinite graphs or fractals.
Recommendations
Cites work
- scientific article; zbMATH DE number 3812514 (Why is no real title available?)
- scientific article; zbMATH DE number 3780202 (Why is no real title available?)
- scientific article; zbMATH DE number 1021609 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3326329 (Why is no real title available?)
- scientific article; zbMATH DE number 3024665 (Why is no real title available?)
- scientific article; zbMATH DE number 3074646 (Why is no real title available?)
- A factor of singular homology
- An Introduction to Banach Space Theory
- Bases and closures under infinite sums
- Geodetic topological cycles in locally finite graphs
- Graph topologies induced by edge lengths
- Infinite Hamilton cycles in squares of locally finite graphs
- Locally finite graphs with ends: A topological approach. I: Basic theory
- MacLane's planarity criterion for locally finite graphs
- On infinite cycles. I, II
- On the homology of locally compact spaces with ends
- The fundamental group of a locally finite graph with ends
- The homology of a locally finite graph with ends
- The word problem for some uncountable groups given by countable words
- Topological circles and Euler tours in locally finite graphs
- Uniqueness of electrical currents in a network of finite total resistance
Cited in
(6)- On spanning tree packings of highly edge connected graphs
- On prisms, Möbius ladders and the cycle space of dense graphs
- Graph topologies induced by edge lengths
- Orthogonality and minimality in the homology of locally finite graphs
- On graph-like continua of finite length
- Cycle map for strictly decomposable cycles
This page was built for publication: Cycle decompositions: from graphs to continua
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q655366)