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. (C) 2018 Elsevier B.V. All rights reserved.
机构:
Univ Ljubljana, Fac Math & Phys, Ljubljana 61000, Slovenia
Univ Maribor, Fac Nat Sci & Math, Maribor, SloveniaBritish Univ Egypt, Dept Basic Sci, El Shorouk, Egypt
Klavzar, Sandi
Salem, Khaled
论文数: 0引用数: 0
h-index: 0
机构:
British Univ Egypt, Dept Basic Sci, El Shorouk, EgyptBritish Univ Egypt, Dept Basic Sci, El Shorouk, Egypt