factor-critical graph
graph with n vertices in which every induced subgraph of n − 1 vertices has a perfect matching
friendship graph
planar undirected graph with 2n+1 vertices and 3n edges
graph with n vertices in which every induced subgraph of n − 1 vertices has a perfect matching