THEOREM (Bondy). Let G be a 2-connected graph such that the degreesum of any three independent vertices is at least m, with m > n + 2 (where n denotes the order of G); then G contains a cycle of… (More)

Let G = (X, E) be a simple graph of order n, of stability number ~ and of connectivity k with ~ _< k. The Chvfital-Erd6s's theorem [3] proves that G is hamiltonian. We have investigated under these… (More)

Amar, D., E. Flandrin, I. Fournier and A. Germa, Pancyclism in hamiltonian graphs, Discrete Mathematics 89 (1991) 111-131. We prove the following theorem. If G is a hamiltonian, nonbipartite graph of… (More)

The main theorem of that paper is the following: let G be a graph of order n, of size at least (nZ 3n + 6) /2 . For any integers k, n,, n2 , . . . , nk such that n = n, + n2 + ... + nk and n, 2 3,… (More)