of a -connected graph is generated by its non-separating induced cycles.

k-linked graph

A graph with at least vertices is called -linked if there are disjoint paths for any sequences and of distinct vertices. Every -linked graph is -connected graph, but not necessarily -connected.

If a graph is -connected and has average degree of at least , then it is -linked.