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