Über die Maximalzahl kreuzungsfreier H-Wege
From MaRDI portal
Publication:1246433
DOI10.1007/BF01226465zbMATH Open0378.05038MaRDI QIDQ1246433FDOQ1246433
Authors: W. Mader 
Publication date: 1979
Published in: Archiv der Mathematik (Search for Journal in Brave)
Cites Work
Cited In (48)
- Packing \(A\)-paths in group-labelled graphs via linear matroid parity
- Rooted topological minors on four vertices
- Maximum number of disjoint paths connecting specified terminals in a graph
- Algebraic algorithms for linear matroid parity problems
- Packing cycles with modularity constraints
- Parameterized Complexity of $$(A,\ell )$$-Path Packing
- Über ein graphentheoretisches Problem von T. Gallai
- Constructing internally disjoint pendant Steiner trees in Cartesian product networks
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
- Weighted linear matroid parity
- Disjoint \(A\)-paths in digraphs
- Über ein graphentheoretisches Ergebnis von T. Gallai
- Minimax theorems for infinite graphs with the ends as ideal points
- Disjoint non-balanced \(A\)-paths in biased graphs
- Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- A weighted linear matroid parity algorithm
- Finding Maximum Edge-Disjoint Paths Between Multiple Terminals
- Packing non-zero \(A\)-paths via matroid matching
- Tree metrics and edge-disjoint \(S\)-paths
- Toughness and edge-toughness
- DisjointT-paths in tough graphs
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- Length-constrained path-matchings in graphs
- Graphs with large generalized (edge-)connectivity
- An algorithm for packing non-zero \(A\)-paths in group-labelled graphs
- Local topological toughness and local factors
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor
- Parameterized complexity of \((A,\ell)\)-path packing
- Matroid matching and some applications
- Multiflows and disjoint paths of minimum total cost
- A generalization of Menger's theorem for certain block-cactus graphs
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- Cliques, minors and apex graphs
- On the \(\ell\)-connectivity of a graph
- The Lovász-Cherkassky theorem in infinite graphs
- A short proof of Mader's \(\mathcal S\)-paths theorem
- Optimal connectivity for fat-triangle linkages
- A minimax theorem for infinite graphs with ideal points
- Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
- On the graphic matroid parity problem
- Packing \(A\)-paths of length zero modulo a prime
- Faster exact algorithms for some terminal set problems
- Packing non-zero \(A\)-paths in an undirected model of group labeled graphs
- Recent techniques and results on the Erdős-Pósa property
- Packings and 2-packings of A-paths
- Packing non-returning \(A\)-paths algorithmically
- The Lovász-Cherkassky theorem in countable graphs
This page was built for publication: Über die Maximalzahl kreuzungsfreier H-Wege
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1246433)
