NetworkX functions to find multiple-edge “bridges” (or multiple-edge cut vertex groups)

Question

In a strongly-connected graph, I am looking to define sub-graphs that contain at least N nodes, and are connected to the rest of the graph by fewer than E edges.

I am