摘要
本文对顶点数不超过11或当v(G)≥9+K(K=1,2,3)且G中至少含有K个次不小于v(G)-K-3的顶点的特殊图证明了Dirac猜想,从而给出一个与Dirac猜想成立等价的命题。
In this paper we prove Dirac conjecture for some special graphs in Which the numbers of ve-rtices are not more than 11, or have K or more vertices of degrees at least v(G)-K-3 with v(G) ≥9+K(K=1,2,3,), hence a proposition equivalent is given for it.
出处
《辽宁大学学报(自然科学版)》
CAS
1991年第2期45-49,共5页
Journal of Liaoning University:Natural Sciences Edition
基金
辽宁省教委青年科学基金
关键词
DIRAC
猜想
完全图
剖分图
Dirac conjecture
complete graph
subdivision of a graph