Factor-Critical Graph

Graph with n vertices in which every induced subgraph of n − 1 vertices has a perfect matching.