定向图的Hamilton有向圈 |
| |
引用本文: | 张存铨.定向图的Hamilton有向圈[J].应用数学学报,1982(4). |
| |
作者姓名: | 张存铨 |
| |
作者单位: | 中国科学院系统科学研究所 |
| |
摘 要: | An oriented graph is a directed graph without loop and with at most one are be-tween each pair of vertices. Let D be an oriented graph of order n such that the in-degree and outdegree of each vertex is at least k. Jackson proved that if n≤2k 2, andk≥2, D contains a Hamiltonian cycle. In this paper, we show that if n≤2k 3, andk≥3, D contains a Hamiltonian cycle.
|
本文献已被 CNKI 等数据库收录! |
|