Affiliation of Author(s):山东大学数学学院

Journal:Journal of Graph Theory

Key Words:Graph，Fan 2k-type graph，edge disjoint Hamilton cycles

Abstract: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.

First Author:Li, G.

Indexed by:Journal paper

Discipline:Natural Science

First-Level Discipline:Mathematics

Document Type:J

Volume:35

Issue:1

Page Number:8-20

Translation or Not:no

Date of Publication:2000-09-01