A Sufficient and Necessary Condition for Hamilton Graph

被引：0
|
作者：
Han, Ruo [1 ]
机构：
[1] XiaMen Univ Technol, Sch Appl Math, Xiamen, Peoples R China
来源：
2ND INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGY FOR EDUCATION (ICTE 2015) | 2015年
关键词：
Hamilton circuit; Hamilton graph; Small circuit; Extending circuit; Circuit edge; Circuit arch;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The paper provides a sufficient and necessary condition for judging whether a simple indirected graph without loops and multiple edges is a Hamilton graph. By this condition it is easy to put forward an algorithm which tries to find a Hamilton circle for a simple indirected graph.
引用
收藏
页码：259 / 261
页数：3
相关论文
共 50 条
12345