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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
