Abstract
A connected undirected graph G is called a Seymour graph if the maximum number of edge disjoint T-cuts is equal to the cardinality of a minimum T-join for every even subset T of V(G). Several families of graphs have been shown to be subfamilies of Seymour graphs (Seymour [5][6], Gerards [1], Szigeti [7]). In this paper we prove a characterization of Seymour graphs which was conjectured by Seb6 and implies the results mentioned above.
Cite
CITATION STYLE
Ageev, A. A., Kostochka, A. V., & Szigeti, Z. (1995). A characterization of seymour graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 920, pp. 364–372). Springer Verlag. https://doi.org/10.1007/3-540-59408-6_65
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
