Disjoint paths in graphs
From MaRDI portal
Cites work
- A short proof of the two-commodity flow theorem
- Four-terminus flows
- Multi-Commodity Network Flows
- On Odd Cuts and Plane Multicommodity Flows
- On the Complexity of Timetable and Multicommodity Flow Problems
- The directed subgraph homeomorphism problem
- The subgraph homeomorphism problem
- Über die Maximalzahl kantendisjunkter A-Wege
Cited in
(only showing first 100 items - show all)- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
- The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs
- The complexity of induced minors and related problems
- A linear algorithm for the all-bidirectional-edges problem on planar graphs
- An improved linear edge bound for graph linkages
- 2-linked graphs
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Edge-disjoint odd cycles in 4-edge-connected graphs
- Graph minor theory
- Edge-disjoint paths in planar graphs
- The disjoint paths problem in quadratic time
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
- Half-integral packing of odd cycles through prescribed vertices
- The Kelmans-Seymour conjecture. I: Special separations
- The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\)
- The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\)
- On the definability of properties of finite graphs
- On finite convexity spaces induced by sets of paths in graphs
- Bounds on path connectivity
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- The Induced Disjoint Paths Problem
- Paths and edge-connectivity in graphs
- Inseparability graphs of oriented matroids
- Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)
- Bonds with parity constraints
- Disjoint sub(di)graphs in digraphs
- Path Separability of Graphs
- Linkless and flat embeddings in 3-space
- Rooted \(K_4\)-minors
- Cycle double covers of infinite planar graphs
- Optimal parallel algorithms for path problems on planar graphs
- Disjoint paths in graphs. III: Characterization
- K5-Subdivisions in Graphs
- Arc-disjoint directed and undirected cycles in digraphs
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
- A simpler proof for the two disjoint odd cycles theorem
- An approach to the subgraph homeomorphism problem
- Improved Algorithms for the 2-Vertex Disjoint Paths Problem
- Tutte's edge-colouring conjecture
- Surfaces, tree-width, clique-minors, and partitions
- A new proof of the flat wall theorem
- List-coloring graphs without subdivisions and without immersions
- 4-connected triangulations and 4-orderedness
- Some recent progress and applications in graph minor theory
- Independent paths and \(K_{5}\)-subdivisions
- The disjoint shortest paths problem
- Removable cycles in non-bipartite graphs
- Disjoint \(A\)-paths in digraphs
- Induced disjoint paths problem in a planar digraph
- Graph minors. IX: Disjoint crossed paths
- Three commodity flows in graphs
- Structure and recognition of graphs with no 6-wheel subdivision
- The reduction of graph families closed under contraction
- The structure of graphs not topologically containing the Wagner graph
- Disjoint paths in symmetric digraphs
- Highly linked graphs
- Packing cycles through prescribed vertices under modularity constraints
- Shortest \((A+B)\)-path packing via hafnian
- Disjoint Paths in a Planar Graph—A General Theorem
- Subdivisions in apex graphs
- Rooted routing in the plane
- On orientations and shortest paths
- The extremal function for \(K_{9}\) minors
- On shortest disjoint paths in planar graphs
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs
- Obstructions for two-vertex alternating embeddings of graphs in surfaces
- Non-planar extensions of subdivisions of planar graphs
- Disjoint Paths in the Plane
- Connectivity for kite-linked graphs
- On obstructions to small face covers in planar graphs
- Finding two edge-disjoint paths with length constraints
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor
- The 2-linkage problem for acyclic digraphs
- scientific article; zbMATH DE number 1439419 (Why is no real title available?)
- Criticality for multicommodity flows
- Obstructions for the Disk and the Cylinder Embedding Extension Problems
- The extremal function for \(K_{8}^{-}\) minors
- Linear time algorithms for two disjoint paths problems on directed acyclic graphs
- scientific article; zbMATH DE number 7561373 (Why is no real title available?)
- General vertex disjoint paths in series-parallel graphs
- Two edge-disjoint paths with length constraints
- Cliques, minors and apex graphs
- The Kelmans-Seymour conjecture. IV: A proof
- The linkedness of cubical polytopes: the cube
- Projective plan and Möbius band obstructions
- Graphs with at most one crossing
- The structure of graphs with no K3,3 immersion
- Homomorphisms of Cayley graphs and cycle double covers
- Optimal connectivity for fat-triangle linkages
- Multiple weak 2-linkage and its applications on integer flows of signed graphs
- Characterization of \((m, n)\)-linked planar graphs
- Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs
- Adjacency in binary matroids
- Fixed-parameter tractability for subset feedback set problems with parity constraints
- Paths and edge-connectivity in graphs. III: Six-terminal k paths
- Disjoint Paths—A Survey
- CONSTRAINED DISJOINT PATHS IN GEOMETRIC NETWORKS
- A graph minor condition for graphs to be \(k\)-linked
- Frustration-critical signed graphs
- The Directed Disjoint Shortest Paths Problem
This page was built for publication: Disjoint paths in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1150632)
