Distances and cuts in planar graphs
From MaRDI portal
Publication:1121897
DOI10.1016/0095-8956(89)90006-3zbMATH Open0675.05025OpenAlexW2139755392MaRDI QIDQ1121897FDOQ1121897
Authors: 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
Recommendations
- Many distances in planar graphs
- On cuts and matchings in planar graphs
- Packings of cuts realizing distances between certain vertices in a planar graph
- Geodesic distance in planar graphs
- Minimal disconnected cuts in planar graphs
- Minimal disconnected cuts in planar graphs
- scientific article; zbMATH DE number 176745
- On distance in some finite planes and graphs arising from those planes
- On the cut dimension of a graph
- Diameter bounds for planar graphs
Cites Work
- Title not available (Why is that?)
- On Odd Cuts and Plane Multicommodity Flows
- Multi-Commodity Network Flows
- Metrics and undirected cuts
- Four-terminus flows
- On Two Commodity Network Flows
- Multicommodity flows in planar graphs
- Multicommodity flows in graphs
- A two-commodity cut theorem
- Two-commodity cut-packing problem
- On fractional multicommodity flows and distance functions
- Title not available (Why is that?)
Cited In (8)
- On integer multiflows and metric packings in matroids
- Many distances in planar graphs
- The Klein bottle and multicommodity flows
- Title not available (Why is that?)
- An efficient algorithm for packing cuts and \((2,3)\)-metrics in a planar graph with three holes
- On finding convex cuts in general, bipartite and plane graphs
- Packings of cuts realizing distances between certain vertices in a planar graph
- On fractional multicommodity flows and distance functions
This page was built for publication: Distances and cuts in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121897)
