Elsevier

Discrete Mathematics

Volume 199, Issues 1–3, 28 March 1999, Pages 237-243
Discrete Mathematics

Note
Another cycle structure theorem for hamiltonian graphs

https://doi.org/10.1016/S0012-365X(98)00336-7Get rights and content
Under an Elsevier user license
open archive

Abstract

A graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show a cycle theorem as follows: If C is a hamiltonian cycle of a graph G of order n, where two non-adjacent vertices x,y at distance 2 on C satisfy d(x)+d(y) ⩾ n, then G is either pancyclic, bipartite, missing only the (n − 1)-cycle, or missing the 3-cycle.

MSC

05C45

Keywords

Hamiltonian graphs
Pancyclic graph
Cycle

Cited by (0)