A characterization of cycle-forced bipartite graphs

A forced cycleC of a graph G is a cycle in G such that G−V(C) has a unique perfect matching. A graph G is a cycle-forced graph if every cycle in G is a forced cycle. In this paper, we give a characterization of cycle-forced hamiltonian bipartite graphs.