未找到相关数据
On the hamiltonian-connectedness for graphs satisfying Ore's Theorem
被引：0
作者：
Shih, Yuan-Kang
[1
]
Su, Hsun
[2
]
Kao, Shin-Shin
[3
]
机构：
[1] Intel-NTU Connected Context Computing Center, National Taiwan University, Taipei, 10617, Taiwan
[2] Department of Public Finance and Taxation, Takming University of Science and Technology, Taipei City 11451, Taiwan
[3] Department of Applied Mathematics, Chung Yuan Christian University, Chung-Li City 32023, Taiwan
来源：
Smart Innovation, Systems and Technologies
|
2013年
/
20卷
关键词：
721.1 Computer Theory;
Includes Computational Logic;
Automata Theory;
Switching Theory;
Programming Theory - 921.4 Combinatorial Mathematics;
Includes Graph Theory;
Set Theory;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
6
引用
收藏
页码：25 / 31
相关论文
未找到相关数据