def maximal_pairwise_disjoint_vertex_subsets(g):
    o = []
    if g.number_of_nodes() == 1:
        return set(g.nodes()[0])
    for n in g.nodes():
        h = g.copy()
        neighbors = h.neighbors(n)
        h.remove(n)
        nx.Graph().remove_nodes_from(neighbors)
        res = maximal_pairwise_disjoint_vertex_subsets(h)
        res.add(n)
        o.append(res)
    return o