Disjoint Paths in a Planar Graph—A General Theorem
From MaRDI portal
Publication:3989016
Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) 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
- Edge-disjoint paths in planar graphs
- scientific article; zbMATH DE number 4089593
- Length-bounded disjoint paths in planar graphs
- Disjoint paths in graphs. I: 3-planar graphs and basic obstructions
- Disjoint paths in graphs. (Reprint)
- On shortest disjoint paths in planar graphs
- On shortest disjoint paths in planar graphs
- Disjoint paths, planarizing cycles, and spanning walks
- Disjoint paths in graphs. II: A special case
- Disjoint paths in graphs
Cited in
(15)- On the connectivity of the disjointness graph of segments of point sets in general position in the plane
- Necessary Condition for Path Partitioning Constraints
- Multicriteria movement synchronization scheduling problems and algorithms
- Hardness of finding two edge-disjoint Min-Min paths in digraphs
- Length-bounded disjoint paths in planar graphs
- Disjoint Paths in the Plane
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- Edge-disjoint homotopic paths in a planar graph with one hole
- Irrelevant vertices for the planar disjoint paths problem
- Finding \(k\) partially disjoint paths in a directed planar graph
- Disjoint paths in graphs. (Reprint)
- Induced disjoint paths problem in a planar digraph
- Disjoint paths in graphs. II: A special case
- Disjoint paths in graphs. III: Characterization
- The pansophy of a graph
This page was built for publication: Disjoint Paths in a Planar Graph—A General Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989016)
