A characterization of cycle-forced bipartite graphs

Abstract A forced cycle C 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.

[1]  Claudio L. Lucchesi,et al.  A characterization of PM-compact bipartite and near-bipartite graphs , 2013, Discret. Math..

[2]  V. Chvátal.  On certain polytopes associated with graphs , 1975 .

[3]  Weiping Shang,et al.  A Characterization of PM-Compact claw-Free cubic graphs , 2014, Discret. Math. Algorithms Appl..

[4]  Yixun Lin,et al.  A characterization of PM-compact Hamiltonian bipartite graphs , 2015 .

[5]  Jinfeng Liu,et al.  A note on pm-compact bipartite graphs , 2014, Discuss. Math. Graph Theory.

[6]  J. A. Bondy,et al.  Graph Theory , 2008, Graduate Texts in Mathematics.