vertex-disjoint paths

vertex-disjoint paths

[¦vər‚teks ′dis‚jȯint ‚paths] (mathematics) In a graph, two paths with common end points that have no other points in common.