On the hyperspace of subcontinua of a finite graph, II
R. Duda (1968)
Fundamenta Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
R. Duda (1968)
Fundamenta Mathematicae
Similarity:
Noskov, Gennady A. (2000)
Geometry & Topology
Similarity:
Kesten, H., Sidoravicius, V., Zhang, Y. (2001)
Electronic Journal of Probability [electronic only]
Similarity:
Komori, Yohei, Sugawa, Toshiyuki, Wada, Masaaki, Yamashita, Yasushi (2006)
Experimental Mathematics
Similarity:
Crisp, John (2005)
Geometry & Topology
Similarity:
Stephen M. Buckley, Alexander Stanoyevitch (2001)
Revista Matemática Iberoamericana
Similarity:
We investigate geometric conditions related to Hölder imbeddings, and show, among other things, that the only bounded Euclidean domains of the form U x V that are quasiconformally equivalent to inner uniform domains are inner uniform domains.
Elder, Murray (2004)
Algebraic & Geometric Topology
Similarity:
Kesten, H., Sidoravicius, V., Zhang, Y. (1998)
Electronic Journal of Probability [electronic only]
Similarity:
Yota Otachi (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The path-distance-width of a connected graph G is the minimum integer w satisfying that there is a nonempty subset of S ⊆ V (G) such that the number of the vertices with distance i from S is at most w for any nonnegative integer i. In this note, we determine the path-distance-width of hypercubes.
Gitik, Rita (1999)
Annals of Mathematics. Second Series
Similarity: