A characterization of minimal non-Seymour graphs

DOI10.1016/j.disc.2015.09.014zbMath1327.05283OpenAlexW2128896075MaRDI QIDQ898107

Marcelo H. De Carvalho, Charles H. C. Little

Publication date: 8 December 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.09.014

zbMATH Keywords

\(T\)-joinconservative functionjoin covered graphmatching covered graphSeymour graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Ear-decompositions of matching-covered graphs
• Matching theory
• Undirected distances and the postman-structure of graphs
• Matching structure and the matching lattice
• The matroids with the max-flow min-cut property
• On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic
• A characterization of Seymour graphs
• Circuit decompositions of join-covered graphs
• On Odd Cuts and Plane Multicommodity Flows

This page was built for publication: A characterization of minimal non-Seymour graphs