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