摘要
利用收缩技术，证明了1）阶为n=2k且最小半度至少是南的有向图D是强哈密尔顿连通的，除非D属于某些图类；2）2强连通且包含n个顶点、（n-1）（n-2）＋4条弧的有向图是强哈密尔顿连通的，除非D属于某些图类．
Using the contraction technique, we prove that i） a digraph D of order n = 2k with minimum semi-degree at least k is strongly Hamiltonian-connected unless D is included in some exceptional classes of digraphs, and that ii） a 2-strong digraph D with n vertices and （n-1）（n-2）＋4 arcs is strongly Hamiltonianconnected unless D belongs to some exceptional classes of digraphs.
出处
《数学的实践与认识》
CSCD
北大核心
2010年第14期178-182,共5页
Mathematics in Practice and Theory
基金
山西省自然科学基金(2007011002)
太原科技大学青年基金(20083018)
关键词
收缩
强略密尔顿连通
最小半度
contraction
strongly Hamiltonian-connected
minimum semi-degree
