This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.


Provides functions for finding and testing for locally \((k, l)\)-connected graphs.

kl_connected_subgraph(G, k, l[, low_memory, …]) Returns the maximum locally \((k, l)\)-connected subgraph of G.
is_kl_connected(G, k, l[, low_memory]) Returns True if and only if G is locally \((k, l)\)-connected.