Packing paths in planar graphs

DOI10.1007/BF02128668MaRDI QIDQ809091zbMATH OpenOpenAlexFDO

Authors 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) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A note on packing paths in planar graphs
• scientific article; zbMATH DE number 16298
• Edge-disjoint paths in planar graphs
• Publication:3211338
• On the complexity of the disjoint paths problem

Cites work

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

Cited in

(16)

• scientific article; zbMATH DE number 1405804 (Why is no real title available?)
• Edge-disjoint paths in planar graphs
• Packing odd paths
• Odd path packings
• Packing paths perfectly
• Multiflow Feasibility: An Annotated Tableau
• scientific article; zbMATH DE number 4191702 (Why is no real title available?)
• On the complexity of the planar directed edge-disjoint paths problem
• A note on packing paths in planar graphs
• scientific article; zbMATH DE number 16298 (Why is no real title available?)
• The path set packing problem
• The edge versus path incidence matrix of series-parallel graphs and greedy packing
• Packings and 2-packings of A-paths
• On return path packing.
• On the tractability of some natural packing, covering and partitioning problems
• Integer Programming and Combinatorial Optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809091)