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

DOI10.1006/jctb.1994.1001zbMath0794.05019OpenAlexW2292254676MaRDI QIDQ1322003

Alexander V. Karzanov

Publication date: 28 August 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.1001

zbMATH Keywords

holesEuclidean planefacescut metricsbipartite planar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items (3)

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. I: Metrics