A k-container C(u,v) of a graph C is a set of k-disjoint paths joining u to v. A k-container C(u, v) is a k* -container if every vertex of C is incident with a path in C(u, v). A graph C is k* -connected if there exists a k*-container between any two dist
關聯:
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
