A characterization of cycle-forced bipartite graphs期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

A characterization of cycle-forced bipartite graphs

Authors:	Xiumei Wang Yipei Zhang Ju Zhou

Affiliation:	1. School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, China;2. Zhengzhou International School, Zhengzhou 450000, China;3. Department of Mathematics, Kutztown University, Kutztown, PA, 19530, USA

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.

Keywords:	Bipartite graph Hamiltonian graph Perfect matching Cycle-forced graph
本文献已被 ScienceDirect 等数据库收录！