Hybrid
======

>>> from networkx import *
>>> from networkx.generators.classic import grid_2d_graph
>>> from networkx.hybrid import *

FC article claims 2d grid graph of size n is (3,3)-connected 
and (5,9)-connected, but I don't think it is (5,9)-connected

>>> G=grid_2d_graph(8,8,periodic=True)
>>> is_kl_connected(G,3,3)
True
>>> is_kl_connected(G,5,9)
False

>>> (H,graphOK)=kl_connected_subgraph(G,5,9,same_as_graph=True)
>>> graphOK
False


>>> G=Graph()
>>> G.add_edge(1,2)
>>> G.add_edge(1,3)
>>> G.add_edge(2,3)
>>> is_kl_connected(G,2,2)
True
>>> H=kl_connected_subgraph(G,2,2)
>>> (H,graphOK)=kl_connected_subgraph(G,2,2,low_memory=True,same_as_graph=True)
>>> graphOK
True