Detecting cycles through three fixed vertices in a graph

H. Fleischner, G.J. Woeginger

    Research output: Contribution to journalArticleAcademicpeer-review

    8 Citations (Scopus)

    Abstract

    We present a simple linear time algorithm for finding a cycle through three fixed vertices in an undirected graph. The algorithm is based on decompositions into triconnected components and on a combinatorial result of Lovász.
    Original languageEnglish
    Pages (from-to)29-33
    JournalInformation Processing Letters
    Volume42
    Issue number1
    DOIs
    Publication statusPublished - 1992

    Fingerprint

    Dive into the research topics of 'Detecting cycles through three fixed vertices in a graph'. Together they form a unique fingerprint.

    Cite this