摘要
通过对Cn,p类图的扩充,研究了(p,q)图(q≤p+1)和Cp的包装问题.对边数q≥C2p-1-2的简单图进行了分类,得到了全部的非哈密顿图,由此大大推广了Ore和Bondy的关于此类问题的结果.
The problem for {G,C p} to be packable has been studied by expanding a kind of graph about C n,p , where |V(G)|=|V(C p)|=p,|E(G)|=q, G is a (p,q) graph (q≤p+1) and C p is a Hamilton cycle. A Hamiltonian classfication of simple graph with q≥C 2 p-1 -2 is given and all of nonhamiltonian graph are thus obtained. It further extends the result that Ore and Bondy have got.
出处
《山东师范大学学报(自然科学版)》
CAS
1998年第3期258-261,共4页
Journal of Shandong Normal University(Natural Science)