Edge-connectivity between edge-ends of infinite graphs
From MaRDI portal
Cites work
- A Mengerian theorem for infinite graphs with ideal points
- Approximating infinite graphs by normal trees
- Arboricity and tree-packing in locally finite graphs
- Aspects topologiques de la séparation dans les graphes infinis. I. II
- Edge-ends in countable graphs
- Enden offener Räume und unendliche diskontinuierliche Gruppen
- Graph topologies induced by edge lengths
- Locally finite graphs with ends: A topological approach. II: Applications
- MacLane's planarity criterion for locally finite graphs
- Menger's theorem for infinite graphs
- Menger's theorem for infinite graphs with ends
- Neuaufbau der Endentheorie
- On end degrees and infinite cycles in locally finite graphs
- The Lovász-Cherkassky theorem for locally finite graphs with ends
- The Lovász-Cherkassky theorem in countable graphs
- Über unendliche Wege in Graphen
Cited in
(2)
This page was built for publication: Edge-connectivity between edge-ends of infinite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962796)