The Cycle Space of an Infinite Graph
From MaRDI portal
Recommendations
Cited in
(44)- Bicycles and left-right tours in locally finite graphs
- A short proof of Fleischner's theorem
- Topological paths, cycles and spanning trees in infinite graphs
- Locally finite graphs with ends: A topological approach. I: Basic theory
- Extremal infinite graph theory
- Graph topologies induced by edge lengths
- On prisms, Möbius ladders and the cycle space of dense graphs
- On end degrees and infinite cycles in locally finite graphs
- MacLane's planarity criterion for locally finite graphs
- Arboricity and tree-packing in locally finite graphs
- Hamilton circles in infinite planar graphs
- Infinite Hamilton cycles in squares of locally finite graphs
- On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs
- An Infinite Graph of Girth 12
- The cycle space of an embedded graph
- Topological cycle matroids of infinite graphs
- Irreducible Divisor Graphs II
- Duality of ends
- On Infinite Cycles in Graphs: Or How to Make Graph Homology Interesting
- Cycle spaces in topological spaces
- The bond and cycle spaces of an infinite graph
- On spanning tree packings of highly edge connected graphs
- Generating cycles in graphs with at most one end
- Algebraic flow theory of infinite graphs
- Embedding a graph-like continuum in a surface
- Relating different cycle spaces of the same infinite graph
- Bases and closures under infinite sums
- On the homology of locally compact spaces with ends
- On infinite cycles. I, II
- Cycle‐cocycle partitions and faithful cycle covers for locally finite graphs
- Uniform even subgraphs and graphical representations of Ising as factors of i.i.d.
- Eulerian Spaces
- The homology of a locally finite graph with ends
- Eulerian edge sets in locally finite graphs
- On vertex-transitive graphs with a unique Hamiltonian cycle
- Hamiltonicity of transitive graphs whose automorphism group has \(\mathbb{Z}_p\) as commutator subgroups
- The first Roe homology group of locally finite graphs
- The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits
- The Erdős-Menger conjecture for source/sink sets with disjoint closures
- Locally finite graphs with ends: A topological approach. II: Applications
- Cycle double covers of infinite planar graphs
- End spaces and spanning trees
- Connected but not path-connected subspaces of infinite graphs
- Infinite highly connected planar graphs of large girth
This page was built for publication: The Cycle Space of an Infinite Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4660556)
