Totally bounded ultrametric spaces generated by labeled rays
From MaRDI portal
Cites work
- A lower bound for the convexity number of some graphs
- An embedding, an extension, and an interpolation of ultrametrics
- Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
- Convex sets under some graph operations
- Convexity in graphs
- Convexity in Graphs and Hypergraphs
- Cycle‐cocycle partitions and faithful cycle covers for locally finite graphs
- Dual trees must share their ends
- Duality in Infinite Graphs
- Duality of ends
- End spaces and spanning trees
- Ends and tangles
- Geodesic Convexity in Graphs
- Graph theory
- How rigid the finite ultrametric spaces can be?
- scientific article; zbMATH DE number 5665274 (Why is no real title available?)
- Isomorphism of trees and isometry of ultrametric spaces
- Labeled trees generating complete, compact, and discrete ultrametric spaces
- Locally finite graphs with ends: A topological approach. I: Basic theory
- Locally finite graphs with ends: a topological approach. III. Fundamental group and homology
- Metrization of weighted graphs
- On some extremal properties of finite ultrametric spaces
- On spaces extremal for the Gomory-Hu inequality
- On the Gomory-Hu inequality
- On the homology of locally compact spaces with ends
- On Urysohn's \(\mathbb{R}\)-tree
- Rebuilding convex sets in graphs
- Some remarks on the convexity number of a graph
- Strongly ultrametric preserving functions
- Subdominant pseudoultrametric on graphs
- Summary on non-Archimedean valued fields
- The complexity of theorem-proving procedures
- The convexity number of a graph
- The fundamental group of a locally finite graph with ends
- The range of ultrametrics, compactness, and separability
- The ultrametric Gromov-Wasserstein distance
- Topological paths, cycles and spanning trees in infinite graphs
- Ultrametrics and Complete Multipartite Graphs
Cited in
(3)
This page was built for publication: Totally bounded ultrametric spaces generated by labeled rays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6954651)
