A characterization of cycle-forced bipartite graphs

被引：4
|
作者：
Wang, Xiumei [1 ]
Zhang, Yipei [2 ]
Zhou, Ju [3 ]
机构：
[1] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R China
[2] Zhengzhou Int Sch, Zhengzhou 450000, Henan, Peoples R China
[3] Kutztown State Univ, Dept Math, Kutztown, PA 19530 USA
来源：
DISCRETE MATHEMATICS | 2018年 / 341卷 / 09期
基金：
中国国家自然科学基金;
关键词：
Bipartite graph; Hamiltonian graph; Perfect matching; Cycle-forced graph; PM-COMPACT BIPARTITE;
D O I：
10.1016/j.disc.2018.06.017
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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.
引用
收藏
页码：2639 / 2645
页数：7
相关论文
共 50 条
12345