On shortest T-joins and packing T-cuts

A.M.H. Gerards

    Research output: Contribution to journalArticleAcademicpeer-review

    6 Citations (Scopus)

    Abstract

    We give a class of graphs with the property that for each even set T of nodes in G the minimum length of a T-join is equal to the maximum number of pairwise edge disjoint T-cuts. Our class contains the bipartite and the series-parallel graphs for which this property was derived earlier by Seymour.
    Original languageEnglish
    Pages (from-to)73-82
    JournalJournal of Combinatorial Theory, Series B
    Volume55
    Issue number1
    DOIs
    Publication statusPublished - 1992

    Fingerprint

    Packing
    Join
    Series-parallel Graph
    Pairwise
    Disjoint
    Graph in graph theory
    Vertex of a graph
    Class

    Cite this

    Gerards, A.M.H. / On shortest T-joins and packing T-cuts. In: Journal of Combinatorial Theory, Series B. 1992 ; Vol. 55, No. 1. pp. 73-82.
    @article{dbb552aef74841ce8daa68a9244d59ba,
    title = "On shortest T-joins and packing T-cuts",
    abstract = "We give a class of graphs with the property that for each even set T of nodes in G the minimum length of a T-join is equal to the maximum number of pairwise edge disjoint T-cuts. Our class contains the bipartite and the series-parallel graphs for which this property was derived earlier by Seymour.",
    author = "A.M.H. Gerards",
    year = "1992",
    doi = "10.1016/0095-8956(92)90032-S",
    language = "English",
    volume = "55",
    pages = "73--82",
    journal = "Journal of Combinatorial Theory, Series B",
    issn = "0095-8956",
    publisher = "Academic Press Inc.",
    number = "1",

    }

    On shortest T-joins and packing T-cuts. / Gerards, A.M.H.

    In: Journal of Combinatorial Theory, Series B, Vol. 55, No. 1, 1992, p. 73-82.

    Research output: Contribution to journalArticleAcademicpeer-review

    TY - JOUR

    T1 - On shortest T-joins and packing T-cuts

    AU - Gerards, A.M.H.

    PY - 1992

    Y1 - 1992

    N2 - We give a class of graphs with the property that for each even set T of nodes in G the minimum length of a T-join is equal to the maximum number of pairwise edge disjoint T-cuts. Our class contains the bipartite and the series-parallel graphs for which this property was derived earlier by Seymour.

    AB - We give a class of graphs with the property that for each even set T of nodes in G the minimum length of a T-join is equal to the maximum number of pairwise edge disjoint T-cuts. Our class contains the bipartite and the series-parallel graphs for which this property was derived earlier by Seymour.

    U2 - 10.1016/0095-8956(92)90032-S

    DO - 10.1016/0095-8956(92)90032-S

    M3 - Article

    VL - 55

    SP - 73

    EP - 82

    JO - Journal of Combinatorial Theory, Series B

    JF - Journal of Combinatorial Theory, Series B

    SN - 0095-8956

    IS - 1

    ER -