Not every 2-tough graph is Hamiltonian

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

    Research output: Book/ReportReportProfessional

    Original languageUndefined
    Place of PublicationEnschede
    PublisherUniversiteit Twente
    Number of pages10
    ISBN (Print)0169-2690
    Publication statusPublished - 1997

    Keywords

    • METIS-141158

    Cite this

    Bauer, D., Broersma, H. J., & Veldman, H. J. (1997). Not every 2-tough graph is Hamiltonian. Enschede: Universiteit Twente.
    Bauer, D. ; Broersma, Haitze J. ; Veldman, H.J. / Not every 2-tough graph is Hamiltonian. Enschede : Universiteit Twente, 1997. 10 p.
    @book{4b4adf6e0e6442c98b68048095db74ca,
    title = "Not every 2-tough graph is Hamiltonian",
    keywords = "METIS-141158",
    author = "D. Bauer and Broersma, {Haitze J.} and H.J. Veldman",
    note = "Memorandum fac. TW nr 1400",
    year = "1997",
    language = "Undefined",
    isbn = "0169-2690",
    publisher = "Universiteit Twente",

    }

    Bauer, D, Broersma, HJ & Veldman, HJ 1997, Not every 2-tough graph is Hamiltonian. Universiteit Twente, Enschede.

    Not every 2-tough graph is Hamiltonian. / Bauer, D.; Broersma, Haitze J.; Veldman, H.J.

    Enschede : Universiteit Twente, 1997. 10 p.

    Research output: Book/ReportReportProfessional

    TY - BOOK

    T1 - Not every 2-tough graph is Hamiltonian

    AU - Bauer, D.

    AU - Broersma, Haitze J.

    AU - Veldman, H.J.

    N1 - Memorandum fac. TW nr 1400

    PY - 1997

    Y1 - 1997

    KW - METIS-141158

    M3 - Report

    SN - 0169-2690

    BT - Not every 2-tough graph is Hamiltonian

    PB - Universiteit Twente

    CY - Enschede

    ER -

    Bauer D, Broersma HJ, Veldman HJ. Not every 2-tough graph is Hamiltonian. Enschede: Universiteit Twente, 1997. 10 p.