On a min--max theorem on bipartite graphs
type: Item
instance of: scholarly article
title: On a min--max theorem on bipartite graphs
zbMATH Open document ID: 1031.05112
DOI: 10.1016/S0012-365X(03)00318-2
author: Zoltán Szigeti
published in: Discrete Mathematics
publication date: 2004-02-14T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 2041918
zbMATH Keywords: Matchings
zbMATH Keywords: \(T\)-joins
MaRDI profile type: Publication
cites work: Vertex set partitions preserving conservativeness
cites work: Matching, Euler tours and the Chinese postman
cites work: Covering directed and odd cuts
cites work: On packing \(T\)-cuts
cites work: Q4852858
cites work: 2-Matchings and 2-covers of hypergraphs
cites work: The Schrijver system of odd join polyhedra
cites work: The matroids with the max-flow min-cut property
cites work: On Odd Cuts and Plane Multicommodity Flows
cites work: The Factorization of Linear Graphs
description: scientific article; zbMATH DE number 2041918