Linked graph
= Linked graph
A graph is $k$-linked when any $2k$ distinct vertices paired as $(x_i,y_i)$ can be joined by $k$ mutually vertex-disjoint paths from $x_i$ to $y_i$.
Unlike <vertex connectivity>, linkage specifies all endpoint pairings simultaneously.