On packing T-cuts
From MaRDI portal
Publication:1333344
DOI10.1006/JCTB.1994.1049zbMATH Open0807.05061OpenAlexW2018263867MaRDI QIDQ1333344FDOQ1333344
Authors: András Frank, Zoltán Szigeti
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
Recommendations
Cited In (12)
- On a min--max theorem on bipartite graphs
- On min-max theorems in matching theory
- On the integral 4-packing of \(T\)-cuts
- Fractional Packing ofT-Joins
- Title not available (Why is that?)
- L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing
- Title not available (Why is that?)
- A new upper bound for unconstrained two-dimensional cutting and packing
- Packing six \(T\)-joins in plane graphs
- An improved typology of cutting and packing problems
- T‐joins intersecting small edge‐cuts in graphs
- Title not available (Why is that?)
This page was built for publication: On packing \(T\)-cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333344)