SMALL CYCLES IN HAMILTONIAN GRAPHS

Authors
SCHELTEN U SCHIERMEYER I
Citation
U. Schelten et I. Schiermeyer, SMALL CYCLES IN HAMILTONIAN GRAPHS, Discrete applied mathematics, 79(1-3), 1997, pp. 201-211
Citations number
7
Categorie Soggetti
Mathematics,Mathematics
Journal title
Discrete applied mathematics → ACNP
Volume
79
Issue
1-3
Year of publication
1997
Pages
201 - 211
Database
ISI
SICI code
Abstract
We prove that if a graph G on n greater than or equal to 32 vertices i s hamiltonian and has two nonadjacent vertices u and v with d(u) + d(v ) greater than or equal to n + z where z = 0 if n is odd and z = 1 if n is even, then G contains all cycles of length m where 3 less than or equal to m less than or equal to 1/5(n + 13).