Packing paths in planar graphs
DOI10.1007/BF02128668zbMATH Open0732.05032OpenAlexW1966166008MaRDI QIDQ809091FDOQ809091
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
Recommendations
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)
Cites Work
Cited In (15)
- Integer Programming and Combinatorial Optimization
- Title not available (Why is that?)
- On return path packing.
- On the complexity of the planar directed edge-disjoint paths problem
- A note on packing paths in planar graphs
- Title not available (Why is that?)
- The path set packing problem
- Odd path packings
- Packing paths perfectly
- Title not available (Why is that?)
- Packing odd paths
- Multiflow Feasibility: An Annotated Tableau
- The edge versus path incidence matrix of series-parallel graphs and greedy packing
- Edge-disjoint paths in planar graphs
- Packings and 2-packings of A-paths
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)