Cherng Chin

  • Citations Per Year
Learn More
Let u and v be any two distinct vertices of an undirected graph G, which is k-connected. For 1 ≤ w ≤ k, a w-container C(u, v) of a k-connected graph G is a set of w-disjoint paths joining u and v. A wcontainer C(u, v) of G is a w∗-container if it contains all the vertices of G. A graph G is w∗-connected if there exists a w∗-container between any two(More)
  • 1