Paths and metrics in a planar graph with three or more holes. II: Paths

DOI10.1006/jctb.1994.1002zbMath0794.05020OpenAlexW2078575982MaRDI QIDQ1322004

Alexander V. Karzanov

Publication date: 6 June 1994

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.1002

zbMATH Keywords

holespackingEuclidean planeplanar graphmulticommodity flowedge-disjoint paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (4)

A generalized cut-condition for multiflows in matroids ⋮ A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes ⋮ An efficient algorithm for packing cuts and \((2,3)\)-metrics in a planar graph with three holes ⋮ Half-integral flows in a planar graph with four holes

This page was built for publication: Paths and metrics in a planar graph with three or more holes. II: Paths