Packing paths in planar graphs

DOI10.1007/BF02128668zbMath0732.05032OpenAlexW1966166008MaRDI QIDQ809091

András Frank

Publication date: 1990

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02128668

zbMATH Keywords

edge-disjoint paths

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Multiflow Feasibility: An Annotated Tableau

Cites Work

• On the planar integer two-flow problem
• On Odd Cuts and Plane Multicommodity Flows
• On the Complexity of Timetable and Multicommodity Flow Problems

This page was built for publication: Packing paths in planar graphs