Distances and cuts in planar graphs
type: Item
instance of: scholarly article
title: Distances and cuts in planar graphs
zbMATH Open document ID: 0675.05025
DOI: 10.1016/0095-8956(89)90006-3
published in: Journal of Combinatorial Theory. Series B
publication date: 1989-01-01T00:00:00Z
full work available at URL: https://ir.cwi.nl/pub/10066
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 4104980
zbMATH Keywords: planar graphs
zbMATH Keywords: distance
zbMATH Keywords: cuts
MaRDI profile type: Publication
OpenAlex ID: W2139755392
cites work: Multi-Commodity Network Flows
cites work: Two-commodity cut-packing problem
cites work: On fractional multicommodity flows and distance functions
cites work: Metrics and undirected cuts
cites work: Q3683847
cites work: Multicommodity flows in graphs
cites work: Multicommodity flows in planar graphs
cites work: On Two Commodity Network Flows
cites work: A two-commodity cut theorem
cites work: Q3916595
cites work: Four-terminus flows
cites work: On Odd Cuts and Plane Multicommodity Flows
Recommended article: Many distances in planar graphs
Recommended article: On cuts and matchings in planar graphs
Recommended article: Packings of cuts realizing distances between certain vertices in a planar graph
Recommended article: Geodesic distance in planar graphs
Recommended article: Minimal disconnected cuts in planar graphs
Recommended article: Minimal Disconnected Cuts in Planar Graphs
Recommended article: Q4036575
Recommended article: On distance in some finite planes and graphs arising from those planes
Recommended article: On the cut dimension of a graph
Recommended article: Diameter bounds for planar graphs
author: Alexander Schrijver
description: scientific article; zbMATH DE number 4104980