Let G be a graph and C be an arbitrary even cycle of G. The graph G is called a cycle-forced graph if G-V(C) has a unique perfect matching. When C is an arbitrary induced even cycle of G, G is called an induced-cycle-forced graph.