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 Sebö and implies the results mentioned above.
Research was partially supported by the Russian Foundation for Fundamental Research, grant 93-011-1486. The second author completed his part of the work when visiting KAM, Charles University.
Research was partially supported by the Hungarian National Foundation for Scientific Research, grants OTKA 2118 and 4271.
Preview
Unable to display preview. Download preview PDF.
References
A. M. H. Gerards, On shortest T-joins and packing T-cuts, J. Comb. Theory B55 (1992) 73–82.
L. Lovász and M. D. Plummer, Matching Theory, Akadémiai Kiadó, Budapest, 1986.
C. Lucchesi and M. H. de Carvalho, oral communication on the Second Do-net Workshop on Combinatorial Optimization, 1994.
A. Sebő, Undirected distances and the postman structure of graphs, J. Comb. Theory B49 (1990) 10–39.
P. D. Seymour, The matroids with the max-flow min-cut property, J. Comb. Theory B23 (1977) 189–222.
P. D. Seymour, On odd cuts and plane multicommodity flows, Proc. London Math. Soc. Ser. (3) 42 (1981) 178–192.
Z. Szigeti, On Seymour Graphs, Report No. 93803-OR, Institute for Operations Research, Universität Bonn, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ageev, A.A., Kostochka, A.V., Szigeti, Z. (1995). A characterization of Seymour graphs. In: Balas, E., Clausen, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1995. Lecture Notes in Computer Science, vol 920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59408-6_65
Download citation
DOI: https://doi.org/10.1007/3-540-59408-6_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59408-6
Online ISBN: 978-3-540-49245-0
eBook Packages: Springer Book Archive