On shortest T-joins and packing T-cuts

A.M.H. Gerards

doi:10.1016/0095-8956(92)90032-S

On shortest T-joins and packing T-cuts

A.M.H. Gerards

Research output: Contribution to journal › Article › Academic › peer-review

7 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 language	English
Pages (from-to)	73-82
Journal	Journal of Combinatorial Theory, Series B
Volume	55
Issue number	1
DOIs	https://doi.org/10.1016/0095-8956(92)90032-S
Publication status	Published - 1992

Access to Document

10.1016/0095-8956(92)90032-S

Cite this

@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",

}

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

SN - 0095-8956

VL - 55

SP - 73

EP - 82

JO - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

IS - 1

ER -

On shortest T-joins and packing T-cuts

Abstract

Access to Document

Fingerprint

Cite this