浏览全部资源
扫码关注微信
Published:1992
移动端阅览
储茂权, 丁立风. NEIGHBORHOOD UNIONS AND HAMILTON-CONNECTEDNESS OF GRAPHS[J]. 1992, (4): 374-376.
DOI:
储茂权, 丁立风. NEIGHBORHOOD UNIONS AND HAMILTON-CONNECTEDNESS OF GRAPHS[J]. 1992, (4): 374-376. DOI:
设G是一个n阶三连通图
且最小度δ(G)≥t
本文证明了若对于G中任意距离为2的点u和v
均有|N(u)∪N(v)|≥n-t+2
则G是Hamilton连通图。
0
Views
14
下载量
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution