A note on packing paths in planar graphs

zbMath0844.90100MaRDI QIDQ1906072

András Frank, Zoltán Szigeti

Publication date: 6 February 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

bipartite graphcut criterionpacking cutssolvability of the edge-disjoint paths problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (3)

Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation ⋮ Planar packing of trees and spider trees ⋮ Integer plane multiflow maximisation: one-quarter-approximation and gaps

This page was built for publication: A note on packing paths in planar graphs