An Excluded Minor Characterization of Seymour Graphs

DOI10.1007/978-3-642-20807-2_1zbMath1298.05295OpenAlexW204628641MaRDI QIDQ3009746

A. A. Ageev, Zoltán Szigeti, András Sebő, Yohann Benchetrit

Publication date: 24 June 2011

Published in: Integer Programming and Combinatoral Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20807-2_1

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph minors (05C83)

Cites Work

• Unnamed Item
• Undirected distances and the postman-structure of graphs
• On shortest \(T\)-joins and packing \(T\)-cuts
• The matroids with the max-flow min-cut property
• On the complexity of the disjoint paths problem
• A characterization of Seymour graphs
• On Odd Cuts and Plane Multicommodity Flows
• 2-Matchings and 2-covers of hypergraphs

This page was built for publication: An Excluded Minor Characterization of Seymour Graphs