D-闭迹存在的一个充分条件

A SUFFICIENT CONDITION FOR D CIRCUIT

所获主要结果是：设Ｇ是ｎ≥３阶几乎无桥的简单连通图，ＧＫ１，ｎ－１．若对Ｇ中任何互不相交的三条边ｅ１，ｅ２及ｅ３有ｄ（ｅ１）＋ｄ（ｅ２）＋ｄ（ｅ３）≥２ｎ＋１则Ｇ有一个Ｄ－闭迹，从而Ｌ（Ｇ）是哈密顿图．

The main result is as follows :let G be a simple connected ,almost bridgeless graph of order n≥3,GK 1,n-1 .If e i∈E(G)(i=1,2,3),V(e i)∩V(e j)=(i≠j,i,j=1,2,3) d (e 1)+ d (e 2)+ d (e 3)≥2n+1, then G Contains a D Circuit.