Objects, Invariants and Properties for Graph Theory (GT) automated conjecturing: in particular with the Sage program CONJECTURING: http://nvcleemp.github.io/conjecturing/
def make_alpha_critical(g):
"""
assumes g is connected, produces connected alpha_critical_subgraph with same independence number.
"""
alpha = independence_number(g)
E = g.edge_iterator(labels=False)
for (v,w) in E:
h = copy(g)
h.delete_edge(v,w)
if h.is_connected() and (alpha == independence_number(h)):
g = h
return g