Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Topics in Combinatorics and Graph Theory |
| Subtitle of host publication | Essays in Honour of Gerhard Ringel |
| Editors | Rainer Bodendiek, Rudolf Henn |
| Place of Publication | Heidelberg |
| Publisher | Physica-Verlag |
| Pages | 101-110 |
| Number of pages | 10 |
| ISBN (Electronic) | 978-3-642-46908-4 |
| ISBN (Print) | 978-3-642-46910-7, 978-3-7908-0439-3 |
| DOIs | |
| Publication status | Published - 1990 |
Fingerprint
Dive into the research topics of 'Around three lemmas in hamiltonian graph theory'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver