Distances and cuts in planar graphs

DOI10.1016/0095-8956(89)90006-3zbMath0675.05025OpenAlexW2139755392MaRDI QIDQ1121897

Alexander Schrijver

Publication date: 1989

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/10066

zbMATH Keywords

distanceplanar graphscuts

Mathematics Subject Classification ID

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

Related Items (4)

On fractional multicommodity flows and distance functions ⋮ The Klein bottle and multicommodity flows ⋮ An efficient algorithm for packing cuts and \((2,3)\)-metrics in a planar graph with three holes ⋮ Packings of cuts realizing distances between certain vertices in a planar graph

Cites Work

• Unnamed Item
• Unnamed Item
• On fractional multicommodity flows and distance functions
• Multicommodity flows in planar graphs
• A two-commodity cut theorem
• Multicommodity flows in graphs
• Metrics and undirected cuts
• Four-terminus flows
• On Odd Cuts and Plane Multicommodity Flows
• On Two Commodity Network Flows
• Two-commodity cut-packing problem
• Multi-Commodity Network Flows

This page was built for publication: Distances and cuts in planar graphs