An Excluded Minor Characterization of Seymour Graphs

DOI10.1007/978-3-642-20807-2_1MaRDI QIDQ3009746zbMATH OpenOpenAlexFDO

Authors Alexander Ageev, Yohann Benchetrit, András Sebö, Zoltán Szigeti

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)

Recommendations

• A characterization of minimal non-Seymour graphs
• A characterization of Seymour graphs
• A characterization of Seymour graphs
• A characterization of some graph classes using excluded minors
• scientific article; zbMATH DE number 1342090
• Excluded-minor characterization of apex-outerplanar graphs
• Seidel minor, permutation graphs and combinatorial properties
• On excluded minors for classes of graphical matroids
• A short derivation of the structure theorem for graphs with excluded topological minors
• The minor crossing number of graphs with an excluded minor

Cites work

• 2-Matchings and 2-covers of hypergraphs
• A characterization of Seymour graphs
• scientific article; zbMATH DE number 3231691 (Why is no real title available?)
• On Odd Cuts and Plane Multicommodity Flows
• On shortest T-joins and packing T-cuts
• On the complexity of the disjoint paths problem
• The matroids with the max-flow min-cut property
• Undirected distances and the postman-structure of graphs

Cited in

(4)

• On the cone of nonnegative circuits
• A characterization of Seymour graphs
• A characterization of Seymour graphs
• A characterization of minimal non-Seymour graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3009746)