An Excluded Minor Characterization of Seymour Graphs
From MaRDI portal
Publication:3009746
DOI10.1007/978-3-642-20807-2_1zbMath1298.05295MaRDI 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
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