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)- Disjoint paths in symmetric digraphs
- Structure and recognition of graphs with no 6-wheel subdivision
- Cliques, minors and apex graphs
- The 2-linkage problem for acyclic digraphs
- An approach to the subgraph homeomorphism problem
- Edge-disjoint paths in planar graphs
- Adjacency in binary matroids
- Paths and edge-connectivity in graphs. III: Six-terminal k paths
- On orientations and shortest paths
- The reduction of graph families closed under contraction
- 2-linked graphs
- On obstructions to small face covers in planar graphs
- General vertex disjoint paths in series-parallel graphs
- A linear algorithm for the all-bidirectional-edges problem on planar graphs
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Rooted routing in the plane
- The complexity of induced minors and related problems
- Tutte's edge-colouring conjecture
- Projective plan and Möbius band obstructions
- The disjoint shortest paths problem
- Disjoint paths in graphs. III: Characterization
- Multiple weak 2-linkage and its applications on integer flows of signed graphs
- Biased graphs with no two vertex-disjoint unbalanced cycles
- The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs
- An improved linear edge bound for graph linkages
- Graph minors. IX: Disjoint crossed paths
- Surfaces, tree-width, clique-minors, and partitions
- Linear time algorithms for two disjoint paths problems on directed acyclic graphs
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
- The linkedness of cubical polytopes: the cube
- Frustration-critical signed graphs
- Electrical flows over spanning trees
- Rooted topological minors on four vertices
- Characterization of \((m, n)\)-linked planar graphs
- Half-integral packing of odd cycles through prescribed vertices
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs
- 7-connected graphs are 4-ordered
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor
- Two disjoint shortest paths problem with non-negative edge length
- Variational analysis down under open problem session
- Graphs with at most one crossing
- Two edge-disjoint paths with length constraints
- Fixed-parameter tractability for subset feedback set problems with parity constraints
- Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)
- Subdivisions in apex graphs
- The extremal function for \(K_{9}\) minors
- Removable cycles in non-bipartite graphs
- Highly linked graphs
- Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs
- Disjoint A-paths in digraphs
- The extremal function for \(K_{8}^{-}\) minors
- Linking four vertices in graphs of large connectivity
- Optimal connectivity for fat-triangle linkages
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- Edge-disjoint odd cycles in 4-edge-connected graphs
- Arc-disjoint directed and undirected cycles in digraphs
- Disjoint sub(di)graphs in digraphs
- Linkage for the diamond and the path with four vertices
- On linkages in polytope graphs
- Finding two edge-disjoint paths with length constraints
- Obstructions for two-vertex alternating embeddings of graphs in surfaces
- Non-planar extensions of subdivisions of planar graphs
- The structure of graphs not topologically containing the Wagner graph
- Graph minor theory
- The Induced Disjoint Paths Problem
- Path Separability of Graphs
- Improved Algorithms for the 2-Vertex Disjoint Paths Problem
- Disjoint Paths—A Survey
- Rooted K₄-minors
- Disjoint Paths in a Planar Graph—A General Theorem
- The disjoint paths problem in quadratic time
- Bonds with parity constraints
- Linkless and flat embeddings in 3-space
- On shortest disjoint paths in planar graphs
- Obstructions for the Disk and the Cylinder Embedding Extension Problems
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
- Packing cycles through prescribed vertices under modularity constraints
- K5-Subdivisions in Graphs
- Criticality for multicommodity flows
- Disjoint Paths in the Plane
- scientific article; zbMATH DE number 1439419 (Why is no real title available?)
- When do Gomory-Hu subtrees exist?
- Counting shortest two disjoint paths in cubic planar graphs with an NC algorithm
- The Directed Disjoint Shortest Paths Problem
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
- Shortest two disjoint paths in polynomial time
- CONSTRAINED DISJOINT PATHS IN GEOMETRIC NETWORKS
- On finite convexity spaces induced by sets of paths in graphs
- List-coloring graphs without subdivisions and without immersions
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- Connectivity for kite-linked graphs
- Homomorphisms of Cayley graphs and cycle double covers
- Walking through waypoints
- Three commodity flows in graphs
- On a coloring conjecture of Hajós
- Independent paths and \(K_{5}\)-subdivisions
- The structure of graphs with no K3,3 immersion
- 4‐Separations in Hajós graphs
- A graph minor condition for graphs to be \(k\)-linked
- Two arc disjoint paths in Eulerian digraphs
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)
