On packing \(T\)-cuts

DOI10.1006/JCTB.1994.1049zbMath0807.05061OpenAlexW2018263867MaRDI QIDQ1333344

Zoltán Szigeti, András Frank

Publication date: 2 March 1995

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1994.1049

zbMATH Keywords

packingChinese postman problem\(T\)-joinmax-flowmin-cut\(T\)-cut

Mathematics Subject Classification ID

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

Related Items (1)

On a min--max theorem on bipartite graphs

This page was built for publication: On packing \(T\)-cuts