共 1 条
- [1] Bondy J.A., 2007, Graph Theory
The matching number and Hamiltonicity of graphs
被引：0
作者：
Li, Rao
[1
]
机构：
[1] Univ South Carolina Aiken, Dept Math Sci, Aiken, SC 29801 USA
关键词：
Matching number;
Hamiltonicity;
05C70;
05C45;
D O I：
10.1080/09728600.2020.1769416
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The matching number of a graph G is the size of a maximum matching in the graph. In this note, we present a sufficient condition involving the matching number for the Hamiltonicity of graphs.
引用
收藏
页码：1094 / 1095
页数：2
相关论文