Graph Theory Ch. 4. Connectivity and paths 1 Chapter 4 Connectivity and Paths.
Internally Disjoint Paths Internally Disjoint Paths : Two paths u to v are internally disjoint if they have no common internal vertex.
