| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8902905 | Discrete Mathematics | 2018 | 7 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Xiumei Wang, Yipei Zhang, Ju Zhou,