SEPARATION OF CARTESIAN PRODUCTS OF GRAPHS INTO SEVERAL CONNECTED COMPONENTS BY THE REMOVAL OF EDGES
Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...
Proceedings of the American Mathematical Society, Vol. 42, No. 2 (Feb., 1974), pp. 588-594 (7 pages) For any topological space X there is an associated ultrametric space U(X) such that the cartesian ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback