On a min--max theorem on bipartite graphs

DOI10.1016/S0012-365X(03)00318-2zbMath1031.05112MaRDI QIDQ1422438

Zoltán Szigeti

Publication date: 14 February 2004

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

zbMATH Keywords

Matchings\(T\)-joins

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• The Schrijver system of odd join polyhedra
• The matroids with the max-flow min-cut property
• On packing \(T\)-cuts
• Vertex set partitions preserving conservativeness
• Covering directed and odd cuts
• On Odd Cuts and Plane Multicommodity Flows
• 2-Matchings and 2-covers of hypergraphs
• Matching, Euler tours and the Chinese postman
• The Factorization of Linear Graphs

This page was built for publication: On a min--max theorem on bipartite graphs