Three recent lemmas have led to results in hamiltonian graph theory which generalize and unify many previous results. Several applications of the lemmas, especially to 1-tough graphs, occur in a survey by Bauer, Schmeichel and Veldman. Recent additional applications are surveyed here. In particular, the lemmas are used to obtain an alternative proof of a recent result of Flandrin, Jung and Li.
Promotores: S.J. Edixhoven, P.Parent
With Summary in French
Thèse Présentee à l'université Bordeaux I
Chapters 1,2 and 3 are going to appear in the Journal of the London Mathematical Society