Remark 2.4 The smallest subset such that... suggests an inductive,
bottom-up characterization: the graphs equipped with unique perfect
matchings are obtained from the empty graph by successively adding matching
edges and potentially joining their endpoints to different connected
components. Precise statements of this kind are given
in [1]},
[2]}.

