Long D3-cycles in graphs with large minimum degree

H. Trommel

    Research output: Book/ReportReportProfessional

    23 Downloads (Pure)


    It is shown that if G is a 2-connected graph on n vertices, with minimum degree such that n≤4δ−6, and with a maximum independent set of cardinality , then G contains a cycle of length at least min {n,n+2δ−2α−2g or G ε F, where F denotes a well-known class of nonhamiltonian graphs of connectivity 2.
    Original languageUndefined
    Place of PublicationEnschede
    PublisherUniversity of Twente
    Number of pages11
    ISBN (Print)0169-2690
    Publication statusPublished - 1997

    Publication series

    NameMemorandum / University of Twente, Faculty of Applied Mathematics
    PublisherUniversiteit Twente


    • METIS-141165
    • IR-30525

    Cite this