Connected but not path-connected subspaces of infinite graphs

DOI10.1007/s00493-007-2188-6zbMath1164.05009OpenAlexW1975467856MaRDI QIDQ949760

Angelos Georgakopoulos

Publication date: 21 October 2008

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-007-2188-6

zbMATH Keywords

Freudenthal compactificationconnected subspacepath-connected subspace

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

Graph-like continua, augmenting arcs, and Menger's theorem ⋮ Contractible edges in 2-connected locally finite graphs ⋮ Dual trees must share their ends ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Locally finite graphs with ends: A topological approach. I: Basic theory ⋮ Infinite Hamilton cycles in squares of locally finite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On infinite cycles. I, II
• The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits
• Graph-theoretical versus topological ends of graphs.
• Über die Enden topologischer Räume und Gruppen
• Topological paths, cycles and spanning trees in infinite graphs
• Ends and multi-endings. I
• 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
• Martin and End Compactifications for Nonlocally Finite Graphs
• Duality in Infinite Graphs
• Forcing highly connected subgraphs
• The Cycle Space of an Infinite Graph
• Random Walks on Infinite Graphs and Groups
• Cycle‐cocycle partitions and faithful cycle covers for locally finite graphs

This page was built for publication: Connected but not path-connected subspaces of infinite graphs