Changes

An equivalent definition of Seymour graphs is that the minimum size of a [[T-join]] equals the maximum number of edge-disjoint [[T-join|T-cuts]] for every node set ''T'' of even size. A co-NP characterization of Seymour graphs is known, see Ageev, Kostochka and Szigeti <ref name="Ag"/>. An excluded minor characterization was given by Ageev, Benchetrit, Sebő, and Szigeti <ref name="Ag2"/>.

==References==