Packings of cuts realizing distances between certain vertices in a planar graph

DOI10.1016/0012-365X(90)90164-DzbMath0728.05030OpenAlexW1994151155MaRDI QIDQ804586

Alexander V. Karzanov

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90164-d

zbMATH Keywords

distancesplanar graphcuts

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

An efficient algorithm for packing cuts and \((2,3)\)-metrics in a planar graph with three holes

Cites Work

• On fractional multicommodity flows and distance functions
• Distances and cuts in planar graphs
• Multicommodity flows in graphs
• Metrics and undirected cuts
• Unnamed Item

This page was built for publication: Packings of cuts realizing distances between certain vertices in a planar graph