Around three lemmas in hamiltonian graph theory

D. Bauer, H.J. Broersma, H.J. Veldman

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademic


    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 languageEnglish
    Title of host publicationTopics in Combinatorics and Graph Theory
    Subtitle of host publicationEssays in Honour of Gerhard Ringel
    EditorsRainer Bodendiek, Rudolf Henn
    Place of PublicationHeidelberg
    Number of pages10
    ISBN (Electronic)978-3-642-46908-4
    ISBN (Print)978-3-642-46910-7, 978-3-7908-0439-3
    Publication statusPublished - 1990


    Dive into the research topics of 'Around three lemmas in hamiltonian graph theory'. Together they form a unique fingerprint.

    Cite this