A characterization of cycle-forced bipartite graphs.

Discrete Mathematics（2018）

引用 0|浏览4

暂无评分

摘要

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.

查看译文

关键词

Bipartite graph,Hamiltonian graph,Perfect matching,Cycle-forced graph

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要