点击次数：

所属单位：山东大学数学学院

发表刊物：Journal of Graph Theory

关键字：Graph，Fan 2k-type graph，edge disjoint Hamilton cycles

摘要：Let G be a graph of order n and k ≥ 0 an integer. It is conjectured in [8] that if for any two vertices u and v of a 2(k + 1)‐connected graph G,d G (u,v) = 2 implies that max{d(u;G), d(v;G)} ≥ (n/2) + 2k, then G has k + 1 edge disjoint Hamilton cycles. This conjecture is true for k = 0, 1 (see cf. [3] and [8]). It will be proved in this paper that the conjecture is true for every integer k ≥ 0.

第一作者：Li, G.

论文类型：期刊论文

学科门类：理学

一级学科：数学

文献类型：J

卷号：35

期号：1

页面范围：8-20

是否译文：否

发表时间：2000-09-01