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
- scientific article; zbMATH DE number 3906192 (Why is no real title available?)
- scientific article; zbMATH DE number 3728302 (Why is no real title available?)
- A two-commodity cut theorem
- Four-terminus flows
- Metrics and undirected cuts
- Multi-Commodity Network Flows
- Multicommodity flows in graphs
- Multicommodity flows in planar graphs
- On Odd Cuts and Plane Multicommodity Flows
- On Two Commodity Network Flows
- On fractional multicommodity flows and distance functions
- Two-commodity cut-packing problem
Cited in
(8)- On integer multiflows and metric packings in matroids
- Many distances in planar graphs
- The Klein bottle and multicommodity flows
- An efficient algorithm for packing cuts and \((2,3)\)-metrics in a planar graph with three holes
- scientific article; zbMATH DE number 5251757 (Why is no real title available?)
- 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)
